Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,475,407 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Adjacency matrix
Angular resolution (graph drawing)
Bipartite half
Clique-width
Expand
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
Seog-Jin Kim
,
Boram Park
2015
Corpus ID: 119737107
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…
Expand
2015
2015
A proposal of an index to the graph isomorphism based on the structural square of a graph (New contact points of algebraic systems, logics, languages, and computer sciences)
神保 秀司
,
中川 雄希
2015
Corpus ID: 124547140
2011
2011
Hamiltonian Paths in the Square of a Tree
J. Radoszewski
,
W. Rytter
International Symposium on Algorithms and…
2011
Corpus ID: 7056470
We introduce a new family of graphs for which the Hamiltonian path problem is non-trivial and yet has a linear time solution. The…
Expand
2011
2011
Hamiltonian Cycles in the Square of a Graph
J. Ekstein
Electronic Journal of Combinatorics
2011
Corpus ID: 710900
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian…
Expand
2010
2010
When is G2 a König–Egerváry Graph?
Vadim E. Levit
,
Eugen Mandrescu
Graphs Comb.
2010
Corpus ID: 585467
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…
Expand
2010
2010
When G^2 is a Konig-Egervary graph?
Vadim E. Levit
,
Eugen Mandrescu
arXiv.org
2010
Corpus ID: 195346476
The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 is joining two distinct vertices…
Expand
2007
2007
Reducing the Dimensionality of Vector Space Embeddings of Graphs
Kaspar Riesen
,
Vivian Kilchherr
,
H. Bunke
IAPR International Conference on Machine Learning…
2007
Corpus ID: 206732161
Graphs are a convenient representation formalism for structured objects, but they suffer from the fact that only a few algorithms…
Expand
2006
2006
Error Compensation in Leaf Power Problems
M. Dom
,
Jiong Guo
,
Falk Hüffner
,
R. Niedermeier
Algorithmica
2006
Corpus ID: 75279
AbstractThe k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether…
Expand
2004
2004
Multi-dimensional Graph Configuration for Natural Language Processing
Ralph Debusmann
,
D. Duchier
,
Marco Kuhlmann
Constraint Solving and Language Processing
2004
Corpus ID: 6198371
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of…
Expand
1979
1979
On 2-factors in squares of graphs
L. Nebeský
1979
Corpus ID: 125596728
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE