Results 31 to 40 of about 1,307,438 (325)

Research on the construction and implementation of power grid fault handling knowledge graphs

open access: yesEnergy Reports, 2023
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

Simplicial Powers of Graphs

open access: yesTheoretical Computer Science, 2008
AbstractIn a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a graph G=(VG,EG) is the k-simplicial power of a graph H=(VH,EH) (H a root graph of G) if VG is the set of all simplicial vertices of H, and for all distinct vertices x and y in VG, xy∈EG if and only if the distance in H between x and y is at most k.
Andreas Brandstädt, Van Bang Le
openaire   +3 more sources

Powerful alliances in graphs

open access: yesDiscrete Mathematics, 2009
AbstractFor a graph G=(V,E), a non-empty set S⊆V is a defensive alliance if for every vertex v in S, v has at most one more neighbor in V−S than it has in S, and S is an offensive alliance if for every v∈V−S that has a neighbor in S, v has more neighbors in S than in V−S. A powerful alliance is both defensive and offensive.
Brigham, Robert C.   +3 more
openaire   +3 more sources

Real Quadratic-Form-Based Graph Pooling for Graph Neural Networks

open access: yesMachine Learning and Knowledge Extraction, 2022
Graph neural networks (GNNs) have developed rapidly in recent years because they can work over non-Euclidean data and possess promising prediction power in many real-word applications.
Youfa Liu, Guo Chen
doaj   +1 more source

Note On The Game Colouring Number Of Powers Of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
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

On the Structure of the Power Graph and the Enhanced Power Graph of a Group

open access: yesThe Electronic Journal of Combinatorics, 2017
Let $G$ be a group‎. ‎The power graph of $G$ is a graph with the vertex‎ ‎set $G$‎, ‎having an edge between two elements whenever one is a power of the other‎. ‎We characterize nilpotent groups whose power graphs have finite independence number‎. ‎For a bounded exponent group‎, ‎we prove its power graph is a perfect graph and we determine‎ ‎its clique ...
Ghodratollah Aalipour   +4 more
openaire   +3 more sources

On the Powers of Signed Graphs [PDF]

open access: yes, 2020
A signed graph is an ordered pair $ =(G, ),$ where $G=(V,E)$ is the underlying graph of $ $ with a signature function $ :E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
Germina K A, Shahul Hameed K, Shijin T V
openaire   +2 more sources

SHACL-Based Validation Method of Knowledge Graph for Power System Model

open access: yesZhongguo dianli, 2022
With the expansion of the power grid and the high penetration of distributed energy resources, the power system analysis and decision-making have put forward higher requirements for comprehensive and accurate power grid models.
Xiaolu LI   +5 more
doaj   +1 more source

On the difference graph of power graphs of finite groups

open access: yesQuaestiones Mathematicae, 2023
2 ...
Kumar, Jitender   +2 more
openaire   +3 more sources

Frequency and voltage partitioning in presence of renewable energy resources for power system (example: North Chile power network) [PDF]

open access: yes, 2016
This paper investigates techniques for frequency and voltage partitioning of power network based on the graph-theory. These methods divide the power system into distinguished regions to avoid the spread of disturbances and to minimize the interaction ...
Al-Emadi, N. A.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy