Connected Domination and Spanning Trees with Many Leaves
From MaRDI portal
Publication:4490780
DOI10.1137/S0895480199353780zbMath0941.05045MaRDI QIDQ4490780
Douglas B. West, Raphael Yuster, Yair Caro
Publication date: 20 July 2000
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
05C05: Trees
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C40: Connectivity
Related Items
ANOTHER LOOK AT k-DOMINATION IN GRAPHS, Bounds on the leaf number in graphs of girth 4 or 5, Partial domination - the isolation number of a graph, Spanning Trees with Many Leaves in Regular Bipartite Graphs, 2-edge connected dominating sets and 2-connected dominating sets of a graph, Spanning trees with few non-leaves, Connected domination in random graphs, Radius, leaf number, connected domination number and minimum degree, Average degree conditions forcing a minor, The 3-rainbow index and connected dominating sets, Note on the upper bound of the rainbow index of a graph, Improved bounds for spanning trees with many leaves, Upper bounds on the \(k\)-forcing number of a graph, Some results on spanning trees, Spanning trees: A survey, Connected domination number of a graph and its complement, \(k\)-domination and \(k\)-independence in graphs: A survey, 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, Connected domination of regular graphs, 2-connected graphs with small 2-connected dominating sets., Computational approaches for zero forcing and related problems, Lower bounds on the number of leaves in spanning trees, Domination parameters of a graph and its complement, Some upper bounds for the 3-proper index of graphs, Some extremal results on the colorful monochromatic vertex-connectivity of a graph, Bounds of the number of leaves of spanning trees in graphs without triangles, Bounds of the number of leaves of spanning trees, Complexity and computation of connected zero forcing, A note on connected domination number and leaf number, Bounds on domination parameters in graphs: a brief survey, Further results on the total monochromatic connectivity of graphs, Constructing a spanning tree with many leaves, Connected power domination in graphs, Bounds on the connected domination number of a graph, Matching properties in connected domination critical graphs, Traceability of connected domination critical graphs, Minimum Degree and Dominating Paths, On the Structure of Graphs Vertex Critical with Respect to Connected Domination, Connected Domination, Spanning Trees and Domination in Hypercubes
