The k-independence number of t-connected graphs

Zhonghua Li and Baoyindureng Wu

Applied Mathematics and Computation, 2021, vol. 409, issue C

Abstract: A set S⊆V(G) is a k-independent set of a graph G if the distance between every two vertices of S is greater than k. The k-independence number αk(G) of G is the maximum cardinality over all k-independent set in G. In this note, we show that if G is a t-connected graph of order n, then α2k+1(G)≤max{1,n−ttk+1} and α2k(G)≤max{1,ntk+1} for any integer k≥0. Both bounds are sharp. For any integer s≥2,p(G,s)=max{min1≤i≤j≤sd(vi,vj):{v1,…,vs}⊆V(G)},is a generalization of the diameter of G. We determine the exact value of the maximum p(G,s) among all t-connected graphs of order n. This includes the main results of a recent paper by Knor and Škrekovski (On the minimum distance in a k-vertex set in a graph, Appl. Math. Comput. 356 (2019) 99–104) and solve an open problem therein.

Keywords: k-independence number; Distance; Connectivity (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005014
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:409:y:2021:i:c:s0096300321005014

DOI: 10.1016/j.amc.2021.126412

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().