Results 51 to 60 of about 3,157 (213)
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
On the tree-number of the power graph associated with some finite groups [PDF]
Given a group G, we define the power graph P(G) as follows: the vertices are the elements of G and two vertices x and y are joined by an edge if ⟨x⟩ ⊆ ⟨y⟩ or ⟨y⟩ ⊆ ⟨x⟩.
Sakineh Rahbariyan
doaj +1 more source
Research on the construction and implementation of power grid fault handling knowledge graphs
Power grid fault disposal has important guiding significance for the efficient and orderly emergency work of power grid accidents. The knowledge graph technology is used to extract, express and manage the fault disposal information.
Na Xiao +5 more
doaj +1 more source
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
A -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 in the Generalized Petersen Graphs
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
Power Domination Number On Shackle Operation with Points as Lingkage
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
Average Degree in Graph Powers [PDF]
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
A survey on the development status and application prospects of knowledge graph in smart grids
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
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

