Results 81 to 90 of about 3,058 (114)

Graph Computing Based Knowledge Reasoning in Electric Power System Considering Knowledge Graph Sparsity

CSEE Journal of Power and Energy Systems
Knowledge graph, which is a rapidly developing technology, provides strong support in business and engineering. Knowledge graph plays an important role in recommendations and decision-making, while in the electric power industry, there would be more ...
Tianjiao Pu, Yuanpeng Tan, Zhenyuan Ma, Jiannan Xu   +3 more
doaj   +1 more source

Resilient Temporal Graph Convolutional Network for Smart Grid State Estimation Under Topology Inaccuracies

IEEE Open Access Journal of Power and Energy
Dynamic State Estimation is a crucial task in power systems. Graph Neural Networks have demonstrated significant potential in dynamic state estimation, for power systems by effectively analyzing measurement data and capturing the complex interactions and
Seyed Hamed Haghshenas, Mia Naeini
doaj   +1 more source

Power system transient stability assessment based on hierarchical graph pooling method considering missing data

International Journal of Electrical Power & Energy Systems
The transient stability assessment (TSA) model based on graph deep learning relies on complete system topology and its characteristics. However, electrical operation data may be missing during the measurement and transmission process, which can lead to a
Chenhao Zhao, Zaibin Jiao, Penghui Zhang, Linbo Zhang   +3 more
doaj   +1 more source

Wind Power Forecast Using Multilevel Adaptive Graph Convolution Neural Network

Energies
Accurate forecasting of wind power is essential for maintaining the stability and efficiency of power networks as renewable energy sources become more integrated.
Oluwaseun E. Duntoye, Kowovi C. Alowonou, Do-Hoon Kwon   +2 more
doaj   +1 more source

Enhanced power graph from the power graph of a group

The power graph of a group $G$ is a graph with vertex set $G$, where two distinct vertices $a$ and $b$ are adjacent if one of $a$ and $b$ is a power of the other. Similarly, the enhanced power graph of $G$ is a graph with vertex set $G$, where two distinct vertices are adjacent if they belong to the same cyclic subgroup.
Pote, Amar S., Kadu, Ganesh S.
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the power graph and the reduced power graph of a finite group

Communications in Algebra, 2019
In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph).
R Rajkumar, T Anitha
exaly   +2 more sources

On the Power of Graph Searching for Cocomparability Graphs

SIAM Journal on Discrete Mathematics, 2016
Summary: In this paper we study how graph searching on a cocomparability graph \(G\) can be used to produce cocomp orderings (i.e., orderings that are linear extensions of some transitive orientation of \(\overline{G}\)) that yield simple algorithms for various intractable problems in general.
Corneil, Derek G., Dusart, Jérémie, Habib, Michel, Köhler, Ekkerhard   +3 more
openaire   +2 more sources

Coloring Powers of Planar Graphs

SIAM Journal on Discrete Mathematics, 2003
Summary: We give nontrivial bounds for the inductiveness or degeneracy of power graphs \(G^{k}\) of a planar graph \(G\). This implies bounds for the chromatic number as well, since the inductiveness naturally relates to a greedy algorithm for vertex-coloring the given graph.
Geir Agnarsson, Magnús M. Halldórsson
openaire   +4 more sources

Graphs whose powers are chordal and graphs whose powers are interval graphs

Journal of Graph Theory, 1997
The main theorem of this paper gives a forbidden induced subgraph condition on \(G\) that is sufficient for chordality of \(G^m\). This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for \(m=2\).
openaire   +2 more sources

Power graphs

J. Inf. Process. Cybern., 1994
Summary: Graphs with vertex set \(V\) can be ``lifted'' to the power set \(V^\#= {\mathcal P}(V)\backslash \{\varnothing\}\). In this paper graphs and their properties, in particular automorphisms and isomorphisms, are studied with respect to this power construction.
Ulrike Baumann, Reinhard Pöschel, Irmgard Schmeichel   +2 more
openaire   +1 more source