超连通图的充分条件(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 |
| _version_ | 1797235797016969216 |
|---|---|
| author | GUOLitao(郭利涛) |
| author_facet | GUOLitao(郭利涛) |
| author_sort | GUOLitao(郭利涛) |
| collection | DOAJ |
| description | 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 degree of a graph G with no isolated vertices as . In this paper,we show that let G be a connected graph with order n and minimum degree δ, if , then G is super-κ. |
| first_indexed | 2024-04-24T16:53:40Z |
| format | Article |
| id | doaj.art-5209fec2f20643a7b16a501807349f3b |
| institution | Directory Open Access Journal |
| issn | 1008-9497 |
| language | zho |
| last_indexed | 2024-04-24T16:53:40Z |
| publishDate | 2018-07-01 |
| publisher | Zhejiang University Press |
| record_format | Article |
| series | Zhejiang Daxue xuebao. Lixue ban |
| spelling | doaj.art-5209fec2f20643a7b16a501807349f3b2024-03-29T01:58:38ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972018-07-0145439139310.3785/j.issn.1008-9497.2018.04.001超连通图的充分条件(Sufficient conditions for graphs to be super connected)GUOLitao(郭利涛)0https://orcid.org/0000-0003-1410-8509(School of Applied Mathematics, Xiamen University of Technology, Xiamen 361024, Fujian Province, China)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 degree of a graph G with no isolated vertices as . In this paper,we show that let G be a connected graph with order n and minimum degree δ, if , then G is super-κ.https://doi.org/10.3785/j.issn.1008-9497.2018.04.001connectivityinverse degreesuper connected |
| spellingShingle | GUOLitao(郭利涛) 超连通图的充分条件(Sufficient conditions for graphs to be super connected) Zhejiang Daxue xuebao. Lixue ban connectivity inverse degree super connected |
| title | 超连通图的充分条件(Sufficient conditions for graphs to be super connected) |
| title_full | 超连通图的充分条件(Sufficient conditions for graphs to be super connected) |
| title_fullStr | 超连通图的充分条件(Sufficient conditions for graphs to be super connected) |
| title_full_unstemmed | 超连通图的充分条件(Sufficient conditions for graphs to be super connected) |
| title_short | 超连通图的充分条件(Sufficient conditions for graphs to be super connected) |
| title_sort | 超连通图的充分条件 sufficient conditions for graphs to be super connected |
| topic | connectivity inverse degree super connected |
| url | https://doi.org/10.3785/j.issn.1008-9497.2018.04.001 |
| work_keys_str_mv | AT guolitaoguōlìtāo chāoliántōngtúdechōngfēntiáojiànsufficientconditionsforgraphstobesuperconnected |