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: | Chung-Yen Wu, 吳忠諺 |
---|---|
Other Authors: | Jenn-Yang Ke |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/29268420642815361824 |
Similar Items
-
On the study of feeback vertex set in Cayley graphs
by: I-hsiao lin, et al.
Published: (2007) -
Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer
by: Liu Hailin
Published: (2019-05-01) -
On the Embedding of the Cayley Graphs
by: Lee, Kuo-Yi, et al.
Published: (2000) -
Quasirandom Cayley graphs
by: David Conlon, et al. -
Colouring Cayley Graphs
by: Chu, Lei
Published: (2006)