Dominating sets whose closed stars form spanning trees

DOI10.1016/0012-365X(95)00334-SMaRDI QIDQ1357724zbMATH OpenFDO

Authors Jerrold W. Grossman

Publication date 16 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

dominating set\(A\)-trailEulerian planar graphspanning star forestspanning star tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Communication networks in operations research (90B18)

Recommendations

• Spanning trees with disjoint dominating and 2-dominating sets
• Spanning trees of countable graphs omitting sets of dominated ends
• Spanning trees and domination in hypercubes
• Spanning Trees and Domination in Hypercubes
• Spanning star trees in regular graphs
• Closure and spanning \(k\)-trees
• Star forests, dominating sets and Ramsey-type problems
• Connected Domination and Spanning Trees with Many Leaves
• scientific article; zbMATH DE number 637297
• Trees with extremal numbers of dominating sets

Cites work

• scientific article; zbMATH DE number 4104992 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 475414 (Why is no real title available?)
• Eulerian graphs and related topics. Part 1, Volume 1
• On non-intersecting Eulerian circuits
• On weakly connected domination in graphs
• Set domination in graphs
• Spanning star trees in regular graphs
• The NP-completeness column: an ongoing guide
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
• The splittance of a graph
• Topics on domination

Cited in

(6)

• Weakly connected domination in graphs
• Connected domination of regular graphs
• Star forests, dominating sets and Ramsey-type problems
• On weakly connected domination in graphs
• Spanning star trees in regular graphs
• Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs

This page was built for publication: Dominating sets whose closed stars form spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357724)