Serni-hyper-connected edge transitive graphs

被引：3

作者：

Zhang, Z

Meng, JX ^{[1
]}

机构：

[1] Xinjiang Univ, Coll Math Sci, Urumqi 830046, Xinjiang, Peoples R China

[2] Xinjiang Univ, Coll Syst Sci, Urumqi 830046, Xinjiang, Peoples R China

来源：

DISCRETE MATHEMATICS | 2006年 / 306卷 / 07期

基金：

中国国家自然科学基金;

关键词：

semi-hyper-connected; edge transitive;

D O I：

10.1016/j.disc.2005.11.019

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is said to be hyper-connected if the removal of every minimum cut creates exactly two connected components, one of which is an isolated vertex. In this paper, we first generalize the concept of hyper-connected graphs to that of semi-hyper-connected graphs: a graph G is called semi-hyper-connected if the removal of every minimum cut of G creates exactly two components. Then we characterize semi-hyper-connected edge transitive graphs. (c) 2006 Elsevier B.V. All fights reserved.

引用

页码：705 / 710

页数：6

共 11 条

[1]

Biggs N., 1993, ALGEBRAIC GRAPH THEO

[2] ON UNRELIABILITY POLYNOMIALS AND GRAPH CONNECTIVITY IN RELIABLE NETWORK SYNTHESIS [J].