| 上连通和超连通的三次Bi-Cayley图 |
| |
| 引用本文： | 曹玲,孟吉翔. 上连通和超连通的三次Bi-Cayley图[J]. 数学季刊, 2009, 24(1) |
| |
| 作者姓名： | 曹玲 孟吉翔 |
| |
| 作者单位： | |
| |
| 摘 要： |
|
| 关 键 词： | 双Cayley图 超级连接 超连接 顶点 有限群 集格 偶图 立方 |
Super-connected and Hyper-connected Cubic Bi-Cayley Graphs |
| |
| CAO Ling MENG Ji-xiang. Super-connected and Hyper-connected Cubic Bi-Cayley Graphs[J]. Chinese Quarterly Journal of Mathematics, 2009, 24(1) |
| |
| Authors: | CAO Ling MENG Ji-xiang |
| |
| Affiliation: | [1]College of Mathemalics and Physics, Xinjiang Agriculture University, Urumqi 830052, China [2]College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China |
| |
| Abstract: | Let G be a finite group and let S(possibly, contains the identity element) be a subset of G. The Bi-Cayley graph BC(G, S) is a bipartite graph with vertex set G×{0, 1} and edge set {(g, 0) (sg, 1) : g∈G, s ∈ S}. A graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph is said to be hyper-connected if every minimum vertex cut creates two components, one of which is an isolated vertex. In this paper, super-connected and/or hyper-connected cubic Bi-Cayley graphs are characterized. |
| |
| Keywords: | super-connected hyper-connected cubic Bi-Cayley graphs |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
