The p-restricted edge-connectivity of Kneser graphs

C. Balbuena and X. Marcote

Applied Mathematics and Computation, 2019, vol. 343, issue C, 258-267

Abstract: Given a connected graph G and an integer 1 ≤ p ≤ ⌊|V(G)|/2⌋, a p-restricted edge-cut of G is any set of edges S ⊂ E(G), if any, such that G−S is not connected and each component of G−S has at least p vertices; and the p-restricted edge-connectivity of G, denoted λp(G), is the minimum cardinality of such a p-restricted edge-cut. When p-restricted edge-cuts exist, G is said to be super-λp if the deletion from G of any p-restricted edge-cut S of cardinality λp(G) yields a graph G−S that has at least one component with exactly p vertices. In this work, we prove that Kneser graphs K(n, k) are λp-connected for a wide range of values of p. Moreover, we obtain the values of λp(G) for all possible p and all n ≥ 5 when G=K(n,2). Also, we discuss in which cases λp(G) attains its maximum possible value, and determine for which values of p graph G=K(n,2) is super-λp.

Keywords: Kneser graphs; Restricted edge connectivity (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318308592
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:343:y:2019:i:c:p:258-267

DOI: 10.1016/j.amc.2018.09.072

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 ().