The Super-Connectivity of Kneser Graphs
A vertex cut of a connected graph G is a set of vertices whose deletion disconnects G. A connected graph G is super-connected if the deletion of every minimum vertex cut of G isolates a vertex. The super-connectivity is the size of the smallest vertex cut of G such that each resultant component does...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
University of Zielona Góra
2019-02-01
|
| Serier: | Discussiones Mathematicae Graph Theory |
| Fag: | |
| Online adgang: | https://doi.org/10.7151/dmgt.2051 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|