Subgraph distances in graphs defined by edge transfers

DOI10.1016/0012-365X(95)00357-3zbMath0880.05031OpenAlexW2074065661MaRDI QIDQ1363654

Gary Chartrand, Elzbieta B. Jarrett, Michelle Schultz, Héctor Hevia

Publication date: 19 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00357-3

zbMATH Keywords

hamiltonicityedge jumpjump graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (11)

Integrity of total transformation graphs ⋮ Unnamed Item ⋮ Hamiltonicity of complements of middle graphs ⋮ A note on dominator chromatic number of line graph and jump graph of some graphs ⋮ Some Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Effcient Dominating Sets ⋮ Domination number and feedback vertex number of complements of line graphs ⋮ Unnamed Item ⋮ Super-connected and hyper-connected jump graphs ⋮ Hamiltonian jump graphs ⋮ On Lict sigraphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gallai graphs and anti-Gallai graphs
• Mortality of iterated Gallai graphs
• Convergent sequences of iterated \(H\)-line graphs
• The footballers of Croam
• Edge rotations and distance between graphs
• A metric for graphs
• On distances between isomorphism classes of graphs
• Rotation and jump distances between graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Graphs whose complement and line graph are isomorphic
• Some Theorems on Abstract Graphs

This page was built for publication: Subgraph distances in graphs defined by edge transfers