Dominating sets whose closed stars form spanning trees
From MaRDI portal
Publication:1357724
DOI10.1016/0012-365X(95)00334-SzbMATH Open0876.05045MaRDI QIDQ1357724FDOQ1357724
Authors: Jerrold W. Grossman 
Publication date: 16 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
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
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)
Cites Work
- Title not available (Why is that?)
- The splittance of a graph
- On weakly connected domination in graphs
- The NP-completeness column: an ongoing guide
- Eulerian graphs and related topics. Part 1, Volume 1
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics on domination
- Title not available (Why is that?)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
- On non-intersecting Eulerian circuits
- Spanning star trees in regular graphs
- Set domination in graphs
Cited In (6)
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)
