Results 41 to 50 of about 254,679 (264)
Ars Mathematica Contemporanea, 2010 Summary: We define a new graph operation called the \(k\)th inner power. The construction-which is somewhat analogous to the \(k\)th power with respect to the direct product-seems to lend itself nicely to certain questions concerning cancellation over the direct product.
Richard H. Hammack, Neal Livesay
openaire +3 more sources
Power Domination in the Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2020 The problem of monitoring an electric power system by placing as few measurement devices in the system can be formulated as a power dominating set problem in graph theory.
Zhao Min, Shan Erfang, Kang Liying
doaj +1 more source
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Zhao, Liying Kang, Gerard J. Chang
openaire +2 more sources
On Power Graph Representation of Γ_1-nonderanged Permutation Group
UMYU Scientifica JournalA -nonderanged permutation group is a permutation group such that where . In this paper, an undirected power graph representation of -nonderanged permutation group denoted by has been studied.
Anas Yusuf, Almustapha Umar
doaj +1 more source
Power Domination Number On Shackle Operation with Points as Lingkage
JTAM (Jurnal Teori dan Aplikasi Matematika), 2020 The Power dominating set is a minimum point of determination in a graph that can dominate the connected dots around it, with a minimum domination point.
Ilham Saifudin
doaj +1 more source
A survey on the development status and application prospects of knowledge graph in smart grids
IET Generation, Transmission & Distribution, 2021 With the advent of the electric power big data era, semantic interoperability and interconnection of power data have received extensive attention. Knowledge graph technology is a new method describing the complex relationships between concepts and ...
Jian Wang, Xi Wang, Chaoqun Ma, Lei Kou
doaj +1 more source
Average Degree in Graph Powers [PDF]
Journal of Graph Theory, 2012 AbstractThe kth power of a simple graph G, denoted by , is the graph with vertex set where two vertices are adjacent if they are within distance k in G. We are interested in finding lower bounds on the average degree of . Here we prove that if G is connected with minimum degree and , then G4 has average degree at least .
Matt DeVos +2 more
openaire +3 more sources
Real Quadratic-Form-Based Graph Pooling for Graph Neural Networks
Machine Learning and Knowledge Extraction, 2022 Graph neural networks (GNNs) have developed rapidly in recent years because they can work over non-Euclidean data and possess promising prediction power in many real-word applications.
Youfa Liu, Guo Chen
doaj +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
SHACL-Based Validation Method of Knowledge Graph for Power System Model
Zhongguo dianli, 2022 With the expansion of the power grid and the high penetration of distributed energy resources, the power system analysis and decision-making have put forward higher requirements for comprehensive and accurate power grid models.
Xiaolu LI +5 more
doaj +1 more source