Super edge-connectivity of mixed Cayley graph

被引：12

作者：

Chen, Jinyang ^{[1
,2
]}

Meng, Jixiang ^{[1
]}

Huang, Lihong ^{[2
]}

机构：

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

[2] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Maximal edge-connectivity; Super edge-connectivity; Mixed Cayley graphs; TRANSITIVE GRAPHS; VERTEX;

D O I：

10.1016/j.disc.2007.12.073

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph X is max-lambda if lambda(X) = delta(X). A graph X is super-lambda if X is max-lambda and every minimum edge-cut set of X isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is max-lambda and super-lambda. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：264 / 270

页数：7

共 12 条

[1]

Bauer D., 1981, The Theory and Application of Graphs, P89

[2] Super-connectivity and super-edge-connectivity for some interconnection networks [J].

Chen, YC ;

Tan, JJM ;

Hsu, LH ;

Kao, SS .

APPLIED MATHEMATICS AND COMPUTATION, 2003, 140 (2-3) :245-254

[3]

Cheng E, 2001, ARS COMBINATORIA, V59, P107

[4]

CODSIL C, 2001, ALGEBRAIC GRAPH THEO, P38

[5] On super edge-connectivity of Cartesian product graphs [J].

Lu, Min ;

Chen, Guo-Liang ;

Xu, Jun-Ming .

NETWORKS, 2007, 49 (02) :152-157

[6] Connectivity of vertex and edge transitive graphs [J].

Meng, JX .

DISCRETE APPLIED MATHEMATICS, 2003, 127 (03) :601-613

[7] Optimally super-edge-connected transitive graphs [J].

Meng, JX .

DISCRETE MATHEMATICS, 2003, 260 (1-3) :239-248

[8]

Tindell R., 1996, COMBINATORIAL NETWOR, P41

[9] The super-connected property of recursive circulant graphs [J].

Tsai, CH ;

Tan, JJM ;

Hsu, LH .

INFORMATION PROCESSING LETTERS, 2004, 91 (06) :293-298

[10] Super restricted edge-connectivity of vertex-transitive graphs [J].

Wang, YQ .

DISCRETE MATHEMATICS, 2004, 289 (1-3) :199-205

← 1 2 →