Vertex-disjoint paths in Cayley color graphs

被引：0

作者：

Kulasinghe, P ^{[1
]}

Bettayeb, S

机构：

[1] Louisiana State Univ, Dept Elect & Comp Engn, Baton Rouge, LA 70803 USA

[2] Southern Univ, Dept Comp Sci, Baton Rouge, LA 70813 USA

来源：

COMPUTERS AND ARTIFICIAL INTELLIGENCE | 1997年 / 16卷 / 06期

关键词：

Cayley color graph; Cayley graph; cost subgraph; interconnection network; strong connectivity; vertex symmetry;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there are \Delta\ vertex-disjoint paths from every vertex to every other vertex in a Cayley color graph associated with a finite group Gamma and a non redundant generating set Delta for Gamma. We also extend this result to a certain class of Cayley graphs.

引用

页码：583 / 597

页数：15

共 50 条

[1] Vertex-disjoint paths in graphs
Egawa, Y
Ota, K
ARS COMBINATORIA, 2001, 61 : 23 - 31
[2] On vertex-disjoint paths in regular graphs
Han, Jie
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
[3] Vertex-disjoint paths in transposition graphs
Fujita, Satoshi
Proceedings of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems, 2006, : 490 - 494
[4] On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
Lai, Cheng-Nan
THEORETICAL COMPUTER SCIENCE, 2015, 571 : 10 - 20
[5] On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups
Lai, Cheng-Nan
INTELLIGENT SYSTEMS AND APPLICATIONS (ICS 2014), 2015, 274 : 92 - 103
[6] Reconfiguration of vertex-disjoint shortest paths on graphs
Saito, Rin
Eto, Hiroshi
Ito, Takehiro
Uehara, Ryuhei
Journal of Graph Algorithms and Applications, 2024, 28 (03) : 87 - 101
[7] Computing Vertex-Disjoint Paths in Large Graphs Using MAOs
Preisser, Johanna E.
Schmidt, Jens M.
ALGORITHMICA, 2020, 82 (01) : 146 - 162
[8] Computing Vertex-Disjoint Paths in Large Graphs Using MAOs
Johanna E. Preißer
Jens M. Schmidt
Algorithmica, 2020, 82 : 146 - 162
[9] Constructing vertex-disjoint paths in (n,k)-star graphs
Lin, Tsung-Chi
Duh, Dyi-Rong
INFORMATION SCIENCES, 2008, 178 (03) : 788 - 801
[10] VERTEX-DISJOINT PATHS AND EDGE-DISJOINT BRANCHINGS IN DIRECTED-GRAPHS
WHITTY, RW
JOURNAL OF GRAPH THEORY, 1987, 11 (03) : 349 - 358

← 1 2 3 4 5 →