m-dominating k-trees of graphs

DOI10.1016/J.DISC.2015.10.013MaRDI QIDQ898133zbMATH OpenOpenAlexFDO

Authors Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan

Publication date 8 December 2015

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-treedominating tree\(n\)-connected graph

Mathematics Subject Classification ID

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

Recommendations

• m-dominating k-ended trees of graphs
• \(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs
• Generalized connected domination in graphs
• Spanning \(k\)-trees of \(n\)-connected graphs
• Spanning \(k\)-tree with specified vertices

Cites work

• A note on Hamiltonian circuits
• Existence of Δλ-cycles and Δλ-paths
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees with bounded degrees
• Spanning trees: A survey
• m-dominating k-ended trees of graphs

Cited in

(2)

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

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

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