Spanning trees with disjoint dominating and 2-dominating sets

DOI10.7151/dmgt.2258zbMath1479.05056OpenAlexW2985527891WikidataQ126793916 ScholiaQ126793916MaRDI QIDQ2062688

Mateusz Miotk, Paweł Żyliński

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2258

zbMATH Keywords

spanning treedomination2-domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Graphs with disjoint 2-dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On spanning trees with restricted degrees
• Dominating and total dominating partitions in cubic graphs
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Diameter-preserving spanning trees in sparse weighted graphs
• Remarks about disjoint dominating sets
• Tree spanners of bounded degree graphs
• Partitioning the vertices of a cubic graph into two total dominating sets
• Disjoint dominating and 2-dominating sets in graphs
• On graphs with disjoint dominating and 2-dominating sets
• The degree-preserving spanning tree problem in strongly chordal and directed path graphs
• A note on graphs with diameter-preserving spanning trees
• Tree Spanners
• Partitioning the Vertices of a Graph into Two Total Dominating Sets

This page was built for publication: Spanning trees with disjoint dominating and 2-dominating sets