Results 31 to 40 of about 8,004,238 (365)
Clustering Powers of Sparse Graphs [PDF]
The Electronic Journal of Combinatorics, 2020 We prove that if $G$ is a sparse graph — it belongs to a fixed class of bounded expansion $\mathcal{C}$ — and $d\in \mathbb{N}$ is fixed, then the $d$th power of $G$ can be partitioned into cliques so that contracting each of these clique to a single vertex again yields a sparse graph.
Nešetřil, Jaroslav +3 more
openaire +3 more sources
Towards sparse matrix operations: graph database approach for power grid computation
Global Energy Interconnection, 2023 The construction of new power systems presents higher requirements for the Power Internet of Things (PIoT) technology. The “source-grid-load-storage” architecture of a new power system requires PIoT to have a stronger multi- source heterogeneous data ...
Daoxing Li +4 more
doaj +1 more source
THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER
BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN, 2023 There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski +6 more
semanticscholar +1 more source
Power Flow Balancing With Decentralized Graph Neural Networks [PDF]
IEEE Transactions on Power Systems, 2021 We propose an end-to-end framework based on a Graph Neural Network (GNN) to balance the power flows in energy grids. The balancing is framed as a supervised vertex regression task, where the GNN is trained to predict the current and power injections at ...
Jonas Berg Hansen +2 more
semanticscholar +1 more source
Powers of chordal graphs [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1983 AbstractAn undirected simple graph G is called chordal if every circle of G of length greater than 3 has a chord. For a chordal graph G, we prove the following: (i) If m is an odd positive integer, Gm is chordal. (ii) If m is an even positive integer and if Gm is not chordal, then none of the edges of any chordless cycle of Gm is an edge of Gr, r < ...
R. Balakrishnan, P. Paulraja
openaire +2 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
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
The First Zagreb Index, The Wiener Index, and The Gutman Index of The Power of Dihedral Group
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 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
Mode Entanglement and Entangling power in Bosonic Graphs [PDF]
, 2003 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