Loading...
Loading...

Go to the content (press return)

The p-restricted edge-connectivity of Kneser graphs

Author
Balbuena, C.; Marcote, F.
Type of activity
Journal article
Journal
Applied mathematics and computation
Date of publication
2019-02-15
Volume
343
First page
258
Last page
267
DOI
10.1016/j.amc.2018.09.072
URL
https://www.sciencedirect.com/science/article/abs/pii/S0096300318308592?via%3Dihub Open in new window
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 is not connected and each component of 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 that has at leas...
Keywords
Kneser graphs, Restricted edge connectivity
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications