A note on the independence number, connectivity and \(k\)-ended tree

DOI10.1016/j.dam.2021.09.004zbMath1476.05155arXiv1810.11242OpenAlexW3201349127MaRDI QIDQ2235267

Pham Hoang Ha

Publication date: 21 October 2021

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

Full work available at URL: https://arxiv.org/abs/1810.11242

zbMATH Keywords

independence numberconnectivity\(k\)-ended tree

Mathematics Subject Classification ID

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

Cites Work

• A \(k\)-tree containing specified vertices
• Spanning trees: A survey
• A degree sum condition concerning the connectivity and the independence number of a graph
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Cycles in graphs with prescribed stability number and connectivity
• Independence number and \(k\)-trees of graphs
• A note on Hamiltonian circuits

This page was built for publication: A note on the independence number, connectivity and \(k\)-ended tree