新疆大学学报（自然科学版）
新疆大學學報（自然科學版）
신강대학학보（자연과학판）
XINJIANG UNIVERSITY JOURNAL(NATURAL SCIENCE EDITION)
2008年
3期
253-262
,共10页
上连通%超连通%超原子%点传递图
上連通%超連通%超原子%點傳遞圖
상련통%초련통%초원자%점전체도
Superconnected graph%hyperconnected%superatom%transitive graph
图 G 称为上连通的,若对每个最小割集C,G-C 有孤立点.G 称为超连通的,若对每个最小割集C,G-C恰有两个连通分支,且其中之一为孤立点.本文刻画了上连通或超连通六次点传递图.
圖 G 稱為上連通的,若對每箇最小割集C,G-C 有孤立點.G 稱為超連通的,若對每箇最小割集C,G-C恰有兩箇連通分支,且其中之一為孤立點.本文刻畫瞭上連通或超連通六次點傳遞圖.
도 G 칭위상련통적,약대매개최소할집C,G-C 유고립점.G 칭위초련통적,약대매개최소할집C,G-C흡유량개련통분지,차기중지일위고립점.본문각화료상련통혹초련통륙차점전체도.
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.
