On the \(r\)-domination number of a graph

DOI10.1016/0012-365X(92)90591-3zbMath0776.05059MaRDI QIDQ1197015

Joan P. Hutchinson, Jerrold R. Griggs

Publication date: 16 January 1993

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

zbMATH Keywords

distancespanning treeEulerian graphvertex degrees\(r\)-domination number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ Higher Independence Complexes of graphs and their homotopy types ⋮ An Algorithm for the Inverse Distance-2 Dominating Set of a Graph ⋮ Some new results on distance \(k\)-domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees in graphs of minimum degree 4 or 5
• A linear algorithm for the domination number of a tree
• Relations between packing and covering numbers of a tree
• Spanning Trees with Many Leaves
• Domination in graphs with minimum degree two
• R -Domination in Graphs
• Graphs with homeomorphically irreducible spanning trees

This page was built for publication: On the \(r\)-domination number of a graph