Connected Domination and Spanning Trees with Many Leaves
From MaRDI portal
DOI10.1137/S0895480199353780zbMATH Open0941.05045MaRDI QIDQ4490780FDOQ4490780
Authors: Yair Caro, Douglas B. West, Raphael Yuster 
Publication date: 20 July 2000
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cited In (47)
- A note on connected domination number and leaf number
- Dominating sets whose closed stars form spanning trees
- Average degree conditions forcing a minor
- The 3-rainbow index and connected dominating sets
- Improved bounds for spanning trees with many leaves
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Connected power domination in graphs
- Some results on spanning trees
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Title not available (Why is that?)
- Spanning trees: A survey
- Spanning Trees and Domination in Hypercubes
- Note on the upper bound of the rainbow index of a graph
- Traceability of connected domination critical graphs
- Constructing a spanning tree with many leaves
- Connected domination in random graphs
- Bounds on the connected domination number of a graph
- Partial domination -- the isolation number of a graph
- Leafy spanning arborescences in DAGs
- Leafy spanning arborescences in DAGs
- Connected domination number of a graph and its complement
- Domination parameters of a graph and its complement
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals
- Matching properties in connected domination critical graphs
- Upper bounds on the \(k\)-forcing number of a graph
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4
- Spanning trees and domination in hypercubes
- Computational approaches for zero forcing and related problems
- Bounds on the leaf number in graphs of girth 4 or 5
- 2-connected graphs with small 2-connected dominating sets.
- Bounds on domination parameters in graphs: a brief survey
- Another look at \(k\)-domination in graphs
- Bounds of the number of leaves of spanning trees in graphs without triangles
- Further results on the total monochromatic connectivity of graphs
- Some upper bounds for the 3-proper index of graphs
- Complexity and computation of connected zero forcing
- Connected domination of regular graphs
- Lower bounds on the number of leaves in spanning trees
- Bounds of the number of leaves of spanning trees
- Radius, leaf number, connected domination number and minimum degree
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- Spanning Trees with Many Leaves in Regular Bipartite Graphs
- On the structure of graphs vertex critical with~respect to connected domination
- Minimum degree and dominating paths
- Spanning trees with few non-leaves
- Connected domination
This page was built for publication: Connected Domination and Spanning Trees with Many Leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490780)
