A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
For a subset S of edges in a connected graph G, S is a k-restricted edge cut if G − S is disconnected and every component of G − S has at least k vertices. The k-restricted edge connectivity of G, denoted by λk(G), is defined as the cardinality of a minimum k-restricted edge cut. Let ξk(G) = min{|[X...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
University of Zielona Góra
2017-08-01
|
| Серии: | Discussiones Mathematicae Graph Theory |
| Предметы: | |
| Online-ссылка: | https://doi.org/10.7151/dmgt.1939 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|