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 |
| id |
ndltd-TW-104TTU05392011 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-104TTU053920112017-11-12T04:38:50Z http://ndltd.ncl.edu.tw/handle/29268420642815361824 A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS 三價凱利圖的有條件的頂點連通性之研究 Chung-Yen Wu 吳忠諺 碩士 大同大學 資訊工程學系(所) 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. Jenn-Yang Ke 柯振揚 2016 學位論文 ; thesis 30 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 大同大學 === 資訊工程學系(所) === 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.
|
| author2 |
Jenn-Yang Ke |
| author_facet |
Jenn-Yang Ke Chung-Yen Wu 吳忠諺 |
| author |
Chung-Yen Wu 吳忠諺 |
| spellingShingle |
Chung-Yen Wu 吳忠諺 A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS |
| author_sort |
Chung-Yen Wu |
| title |
A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS |
| title_short |
A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS |
| title_full |
A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS |
| title_fullStr |
A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS |
| title_full_unstemmed |
A STUDY OF CONDITIONAL VERTEX CONNECTIVITY OF TRIVALENT CAYLEY GRAPHS |
| title_sort |
study of conditional vertex connectivity of trivalent cayley graphs |
| publishDate |
2016 |
| url |
http://ndltd.ncl.edu.tw/handle/29268420642815361824 |
| work_keys_str_mv |
AT chungyenwu astudyofconditionalvertexconnectivityoftrivalentcayleygraphs AT wúzhōngyàn astudyofconditionalvertexconnectivityoftrivalentcayleygraphs AT chungyenwu sānjiàkǎilìtúdeyǒutiáojiàndedǐngdiǎnliántōngxìngzhīyánjiū AT wúzhōngyàn sānjiàkǎilìtúdeyǒutiáojiàndedǐngdiǎnliántōngxìngzhīyánjiū AT chungyenwu studyofconditionalvertexconnectivityoftrivalentcayleygraphs AT wúzhōngyàn studyofconditionalvertexconnectivityoftrivalentcayleygraphs |
| _version_ |
1718561326311145472 |