A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS
碩士 === 大同大學 === 資訊工程學系(所) === 104 === Let G be a graph. A subset F⊂V(G) is called an R^k-vertex-cut of G if G-F is disconnected and each vertex u∈V(G)-F has at least k good neighbors in G-F. The size of a minimum R^k-vertex-cut of G, denoted by κ^k (G), is the R^k-vertex-connectivity of G. In this t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29268420642815361824 |
| Summary: | 碩士 === 大同大學 === 資訊工程學系(所) === 104 === Let G be a graph. A subset F⊂V(G) is called an R^k-vertex-cut of G if G-F is disconnected and each vertex u∈V(G)-F has at least k good neighbors in G-F. The size of a minimum R^k-vertex-cut of G, denoted by κ^k (G), is the R^k-vertex-connectivity of G. In this thesis, we prove that κ^1 (G_n) is equal to 4 for n≥3, κ^2 (G_n) is equal to 8 for n≥4, where G_n is the trivalent Cayley graphs.
|
|---|