Dominating sets whose closed stars form spanning trees

DOI10.1016/0012-365X(95)00334-SzbMath0876.05045MaRDI QIDQ1357724

Jerrold W. Grossman

Publication date: 16 June 1997

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

zbMATH Keywords

dominating set; \(A\)-trail; Eulerian planar graph; spanning star forest; spanning star tree

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

90B18: Communication networks in operations research

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs

Related Items

Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs, Connected domination of regular graphs, On weakly connected domination in graphs, Spanning star trees in regular graphs, Weakly Connected Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On non-intersecting Eulerian circuits
• The splittance of a graph
• Eulerian graphs and related topics. Part 1, Volume 1
• Topics on domination
• On weakly connected domination in graphs
• Spanning star trees in regular graphs
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
• The NP-completeness column: an ongoing guide
• Set domination in graphs