Results 11 to 20 of about 1,307,438 (325)
Recent developments on the power graph of finite groups – a survey
AKCE International Journal of Graphs and Combinatorics, 2021 Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools
Ajay Kumar +3 more
doaj +1 more source
The Power Index of a Graph [PDF]
Graphs and Combinatorics, 2017 The {\em power index} $ ( )$ of a graph $ $ is the least order of a group $G$ such that $ $ can embed into the power graph of $G$. Furthermore, this group $G$ is {\em $ $-optimal} if $G$ has order $ ( )$. We say that $ $ is {\em power-critical} if its order equals to $ ( )$. This paper focuses on the power indices of complete graphs, complete
Xuanlong Ma, Min Feng, Kaishun Wang
openaire +2 more sources
A network approach for power grid robustness against cascading failures [PDF]
, 2015 Cascading failures are one of the main reasons for blackouts in electrical power grids. Stable power supply requires a robust design of the power grid topology.
Kooij, Robert E. +3 more
core +5 more sources
Journal of Modern Power Systems and Clean Energy, 2023 Reliable and accurate ultra-short-term prediction of wind power is vital for the operation and optimization of power systems. However, the volatility and intermittence of wind power pose uncertainties to traditional point prediction, resulting in an ...
Wenlong Liao +5 more
doaj +1 more source
Forbidden Subgraphs of Power Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either $u=v^i$ or $v=u^j$ for some $i$, $j$.
Manna, Pallabi +2 more
openaire +5 more sources
Mathematica Bohemica, 1997 The concept of magic graph was introduced by J. Sedláček. A valuation of the edges of a graph by pairwise different positive numbers is called magic, if the sum of values of edges incident with a given vertex is the same for all vertices. If there exists a magic valuation of a graph \(G\), then \(G\) is called a magic graph.
Marián Trenkler, Vladimír Vetchý
openaire +2 more sources
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
Research Review of the Knowledge Graph and its Application in Power System Dispatching and Operation
Frontiers in Energy Research, 2022 With the construction of a new power system and the proposal of a double carbon goal, power system operation data are growing explosively, and the optimization of power system dispatching operation is becoming more and more complex.
Junbin Chen +5 more
doaj +1 more source
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
A Review of Graph Neural Networks and Their Applications in Power Systems
Journal of Modern Power Systems and Clean Energy, 2022 Deep neural networks have revolutionized many machine learning tasks in power systems, ranging from pattern recognition to signal processing. The data in these tasks are typically represented in Euclidean domains.
Wenlong Liao +4 more
doaj +1 more source