Skip to search formSkip to main contentSkip to account menu

Graph power

Known as: Power of graph, Square (disambiguation), Square of a graph 
In graph theory, a branch of mathematics, the kth power Gk of an undirected graph G is another graph that has the same set of vertices, but in which… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Adjacency matrixAngular resolution (graph drawing)Bipartite halfClique-width

Broader (1)

Graph operations

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Coloring the squares of graphs whose maximum average degrees are less than 4
The square $G^2$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^2$ if the… 
2015
2015
Single Mode Optical Fiber in Rof System Using DWDM
Performance analysis was carried out to find the effect of crosstalk in a WDM system. Firstly, analysis of BER was carried out… 
2015
2015
Power of Graph-Based Two-Sample Tests
Testing equality of two multivariate distributions is a classical problem for which many non-parametric tests have been proposed… 
2013
2013
BOUNDS ON ROMAN DOMINATION IN SQUARES OF GRAPHS
A Roman dominating function on a square graph is a function satisfying the condition that every vertex for which is adjacent to… 
2012
2012
Bounds on Connected Domination in Squares of Graphs
Let ( , ) G V E = be a graph. In this paper we denote the number of vertices of G as p and q the number of edges. A set ' D V… 
2012
2012
Harmonic evolutions on graphs
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over $Z_2… 
2011
2011
Planar graphs with largest injective chromatic numbers ∗
An injective coloring of graphs is a vertex coloring where two vertices receive distinct colors if they have a common neighbor… 
2010
2010
When is G2 a König–Egerváry Graph?
The independence number of a graph G, denoted by α(G), is the cardinality of a maximum independent set, and μ(G) is the size of a… 
2005
2005
Chip firing and vertex cover of squares of graphs
In the chip firing game a number of chips is initially distributed on some vertices of a graph G. Then at every step of the game… 
2004
2004
Multi-dimensional Graph Configuration for Natural Language Processing
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of…