A sufficient condition for dominating cycles

DOI10.1016/0012-365X(87)90029-XzbMath0634.05045MaRDI QIDQ1096645

J. A. Bondy, Geng-Hua Fan

Publication date: 1987

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

zbMATH Keywords

dominating cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (10)

Longest cycles in triangle-free graphs ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ A note on distance-dominating cycles ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Unnamed Item ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Cycles within specified distance from each vertex. ⋮ On minimal geodetic domination in graphs ⋮ Perfect matching dominating cycle — a new dominating cycle ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item

This page was built for publication: A sufficient condition for dominating cycles