Spanning connectivity of the power of a graph and Hamilton-connected index of a graph

DOI10.1007/s00373-013-1362-4zbMath1306.05138OpenAlexW2035294258MaRDI QIDQ489324

Eminjan Sabir, Elkin Vumar

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1362-4

zbMATH Keywords

unicyclic graphHamilton-connected indexHamiltonian indexpower of graphspanning connectivity

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Degree sequence conditions for a graph to be disjoint path coverable ⋮ On the spanning connectivity of tournaments ⋮ Panconnected index of graphs ⋮ Minimum number of components of 2-factors in iterated line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the versatile version of Fleischner's theorem
• The spanning connectivity of line graphs
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• On the spanning connectivity of graphs
• On the spanning fan-connectivity of graphs
• Hamilton-connected indices of graphs
• A short proof of Fleischner's theorem
• A new proof of the theorem by Fleischner
• Graph whose edges are in small cycles
• The square of a block is vertex pancyclic
• The square of a block is Hamiltonian connected
• The square of a block is strongly path connected
• Hamiltonian iterated line graphs
• The Hamiltonian index of a graph and its branch-bonds
• On spanning connected graphs
• Graphs with 1-hamiltonian-connected cubes
• On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
• The square of every two-connected graph is Hamiltonian
• Hamiltonian Paths in Squares of Infinite Locally Finite Blocks
• On a certain ordering of the vertices of a tree
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On the Cube of a Graph
• On Hamiltonian Line-Graphs
• The cube of every connected graph is 1-hamiltonian
• Trees with Hamiltonian square
• Hamilton cycles and closed trails in iterated line graphs
• The hamiltonian index of a graph

This page was built for publication: Spanning connectivity of the power of a graph and Hamilton-connected index of a graph