A note on distance-dominating cycles
From MaRDI portal
Publication:1101128
DOI10.1016/0012-365X(88)90033-7zbMath0642.05031OpenAlexW1965392875MaRDI QIDQ1101128
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(88)90033-7
Related Items (7)
Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Distance domination in graphs with given minimum and maximum degree ⋮ Edge-diameter of a graph and its longest cycles ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
This page was built for publication: A note on distance-dominating cycles
