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

DOI10.1016/J.AKCEJ.2017.04.004zbMath1375.05206OpenAlexW2616167397MaRDI QIDQ1680883

Masao Tsugaki, Gui Ying Yan

Publication date: 17 November 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.04.004

zbMATH Keywords

\(k\)-ended tree\(m\)-dominatingvertex dominating

Mathematics Subject Classification ID

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

Cites Work

• \(m\)-dominating \(k\)-ended trees of graphs
• 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 \(l\)-connected graphs