The \(k\)-independence number of \(t\)-connected graphs

DOI10.1016/j.amc.2021.126412zbMath1497.05209OpenAlexW3167454880MaRDI QIDQ2244182

Zhonghua Li, Baoyindureng Wu

Publication date: 11 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126412

zbMATH Keywords

distanceconnectivity\(k\)-independence number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

Independence numbers of polyhedral graphs ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship

Cites Work

• Spectral bounds for the \(k\)-independence number of a graph
• Independence and average distance in graphs
• An eigenvalue characterization of antipodal distance-regular graphs
• On the injective chromatic number of graphs
• On the minimum distance in a \(k\)-vertex set in a graph
• On the \(k\)-independence number of graphs
• Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(k\)-independence number of \(t\)-connected graphs