Hamiltonian Cycles in the Square of a Graph
Copyright policy )Hamiltonian Cycles in the Square of a Graph
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at distance at least four.
- University of West Bohemia Czech Republic
Eulerian and Hamiltonian graphs, Connectivity, Hamiltonian cycle, square, block graph, connection of graphs, star, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Paths and cycles, 05C45
Eulerian and Hamiltonian graphs, Connectivity, Hamiltonian cycle, square, block graph, connection of graphs, star, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Paths and cycles, 05C45
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!