超连通图的充分条件(Sufficient conditions for graphs to be super connected)
Let G be a connected graph. The connectivity κ(G) of a connected graph G is the least positive integer k such that there is F⊂V, | F | = k, and G—F is disconnected or is a trivial graph. If every minimum vertex cut isolates a vertex of G, a graph G is super connected or super-κ. Define the inverse d...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2018-07-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2018.04.001 |