\(m\)-dominating \(k\)-ended trees of graphs

DOI10.1016/J.DISC.2014.06.005zbMath1298.05252OpenAlexW2094197723MaRDI QIDQ400391

Mikio Kano, Masao Tsugaki, Gui Ying Yan

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.005

zbMATH Keywords

dominating set\(k\)-ended treetree with few leaves

Mathematics Subject Classification ID

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

Related Items (2)

\(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs ⋮ \(m\)-dominating \(k\)-trees of graphs

Cites Work

• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees: A survey
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Existence of Δλ-cycles and Δλ-paths

This page was built for publication: \(m\)-dominating \(k\)-ended trees of graphs