田应智, 孟吉翔. 上连通和超连通六次点传递图(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2008, 111(3): 253-262.DOI：
上连通和超连通六次点传递图(英文)
摘要
图G称为上连通的
若对每个最小割集C
G-C有孤立点.G称为超连通的
若对每个最小割集C
G-C恰有两个连通分支
且其中之一为孤立点.本文刻画了上连通或超连通六次点传递图.
Abstract
A graph G is said to be superconnected if for every minimum vertex cut C
G-C has isolated vertices. G is said to be hyperconnected if for every minimum vertex cut C of G
G-C has exactly two components one of which is an isolated vertex. In this paper
we characterize superconnected or hyperconnected vertex transitive graphs with degree 6.
关键词
Keywords
references
Boesch F. On unreliability polynomials and graph connectivity in reliable network synthesis [J]. Graph Theory,1986,10: 339-352.
Boesch F. Synthesis of reliable networks-a survey [J]. IEEE Trans Reliable, 1986, 35: 240-246.
Mader M. Minimal n -fach Kantenzusammenhangenden Granphen [J].Math Ann, 1971, 191: 21-28. [ 4] Tindell R. Connectivity of Cayley graphs [M].in: D. Z. Du, D. F. Hsu (eds.),Combinatorial Network Theory, 1996, 41-64.
Meng Jixiang. Connevtivity of vertex and edge transitive graphs [J]. Discrete Applied Mathematics, 2003, 127:601- 613.
Wang Dameng, Meng Jixiang. Superconnected and Hyperconnected Cubic Transitive Graphs [J]. OR Transactions, 2001,5(4): 35-40.
Hamidone Y O. Subsets with small sums in abelian groups' I: the vosper property [J]. Europ Combin, 1997, 4:541- 556.
Chen Liang. The Connectivity of Vertex-transitive Graphs with Small Regular Degrees [J]. Xinjiang University, 2000,4: 5-7. [ 9] Lakshmivaraham S, Jwo Jung-Sing, Dhall S K. Symmetry in interconnection networks on Cayley graphs of permutation groups: a survey [J]. Parallel Comput, 1993, 19:361-407.
京公网安备11010802024621