m-dominating k-ended trees of l-connected graphs

DOI10.1016/J.AKCEJ.2017.04.004zbMATH Open1375.05206OpenAlexW2616167397MaRDI QIDQ1680883FDOQ1680883

Authors: Masao Tsugaki, Guiying 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

Recommendations

• \(m\)-dominating \(k\)-ended trees of graphs
• \(m\)-dominating \(k\)-trees of graphs
• Spanning \(k\)-ended trees of bipartite graphs
• \(k\)-domination and connected \(k\)-domination in graphs
• Spanning \(k\)-ended trees of 3-regular connected graphs
• Connected \(k\)-dominating graphs
• A note on the independence number, connectivity and \(k\)-ended tree
• On connected \(k\)-domination in graphs
• Spanning \(k\)-ended trees in quasi-claw-free graphs
• Spanning \(k\)-trees of \(n\)-connected graphs

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

• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Existence of Δλ-cycles and Δλ-paths
• \(m\)-dominating \(k\)-ended trees of graphs

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680883)