Results 21 to 30 of about 1,347,292 (277)
Note On The Game Colouring Number Of Powers Of Graphs
Discussiones 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
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 +3 more sources
SHACL-Based Validation Method of Knowledge Graph for Power System Model
Zhongguo 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
Frequency and voltage partitioning in presence of renewable energy resources for power system (example: North Chile power network) [PDF]
, 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
Some Graph Polynomials of the Power Graph and its Supergraphs [PDF]
Mathematics Interdisciplinary Research, 2020 In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
Asma Hamzeh
doaj +1 more source
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
Journal of Mathematics, 2023 A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj +1 more source
, 2011 The topological (graph) structure of complex networks often provides valuable information about the performance and vulnerability of the network. However, there are multiple ways to represent a given network as a graph.
Barrows, Clayton +3 more
core +1 more source
Signless Laplacian spectrum of power graphs of finite cyclic groups
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper, we have studied the Signless Laplacian spectrum of the power graph of finite cyclic groups. We have shown that is an eigen value of Signless Laplacian of the power graph of with multiplicity at least In particular, using the theory of ...
Subarsha Banerjee, Avishek Adhikari
doaj +1 more source
On groups with specified quotient power graphs [PDF]
International Journal of Group Theory, 2016 . In this paper we study some relations between the power andquotient power graph of a finite group. These interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a ...
Mostafa Shaker, Mohammadali Iranmanesh
doaj
Graph Sampling for Covariance Estimation
, 2017 In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs.
Chepuri, Sundeep Prabhakar, Leus, Geert
core +1 more source