Connectivity of connected bipartite graphs with two orbits

被引：0
|
作者：
Liang, Xiaodong [1 ]
Meng, Jixiang [1 ]
机构：
[1] Xinjiang Univ, Coll Math & Syst Sci, Xinjiang 830046, Peoples R China
来源：
COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS | 2007年 / 4489卷
关键词：
connectivity; bipartite graph; orbit;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Let X = (V, E) be a simple connected graph, the connectivity kappa(X) of X is the minimum cardinality of all vertex cut sets in X. Let x is an element of V(X), the set {x(g) : g is an element of Aut(X)} is called an orbit of Aut(X), the automorphism group of X. In this note, we prove that the connectivity of a connected bipartite graph with two orbits attains its minimum degree.
引用
收藏
页码：334 / +
页数：2
相关论文
共 50 条
12345