Results 21 to 30 of about 1,361,107 (277)
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
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
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
Power Domination in Graphs [PDF]
In this chapter, we are interested in power domination in graphs. Power domination is a variation of domination introduced to address a physical problem of monitoring a network with phasor measurement units. The originality of this variation is that some propagation happens, and the set of covered vertices results from an iterative process.
openaire +3 more sources
The First Zagreb Index, The Wiener Index, and The Gutman Index of The Power of Dihedral Group
Research on graphs combined with groups is an interesting topic in the field of combinatoric algebra where graphs are used to represent a group. One type of graph representation of a group is a power graph.
Evi Yuniartika Asmarani +5 more
doaj +1 more source
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs [PDF]
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules.
Dwyer, Tim +5 more
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brandstädt, Andreas, Le, Van Bang
openaire +2 more sources
Mode Entanglement and Entangling power in Bosonic Graphs [PDF]
We analyze the quantum entanglement properties of bosonic particles hopping over graph structures.Mode-entanglement of a graph vertex with respect the rest of the graph is generated, starting from a product state, by turning on for a finite time a ...
Giorda, Paolo, Zanardi, Paolo
core +1 more source
A Random Graph Model for Power Law Graphs [PDF]
We propose a random graph model which is a special case of sparserandom graphs with given degree sequences which satisfy a power law. This model involves only a small number of paramo eters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. From these parameters, various properties of the
Aiello, William, Chung, Fan, Lu, Linyuan
openaire +2 more sources
Note On The Game Colouring Number Of Powers Of Graphs
We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj +1 more source

