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 条
  • [21] Dominator Tree Verification and Vertex-Disjoint Paths
    Georgiadis, Loukas
    Tarjan, Robert E.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 433 - 442
  • [22] Partitioning a bipartite graph into vertex-disjoint paths
    Li, Jianping
    Steiner, George
    ARS COMBINATORIA, 2006, 81 : 161 - 173
  • [23] Finding Arc and Vertex-Disjoint Paths in Networks
    Xie, Zheng
    Chen, Zhi
    Leng, Hongze
    Zhang, Jun
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2009, : 539 - +
  • [24] Dissemination of information in vertex-disjoint paths mode
    Hromkovic, J
    Klasing, R
    Stohr, EA
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1996, 15 (04): : 295 - 318
  • [25] Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
    Borradaile, Glencora
    Nayyeri, Amir
    Zafarani, Farzad
    ALGORITHMS - ESA 2015, 2015, 9294 : 227 - 238
  • [26] COVERING VERTICES OF A GRAPH BY VERTEX-DISJOINT PATHS
    NOORVASH, S
    PACIFIC JOURNAL OF MATHEMATICS, 1975, 58 (01) : 159 - 168
  • [27] A New Algorithm for Finding Vertex-Disjoint Paths
    Kurt, Mehmet
    Berberler, Murat
    Ugurlu, Onur
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2015, 12 (06) : 550 - 555
  • [28] COVERING VERTICES OF A GRAPH BY VERTEX-DISJOINT PATHS
    NOORVASH, S
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (01): : A46 - A46
  • [29] OPTIMAL COVERING OF CACTI BY VERTEX-DISJOINT PATHS
    MORAN, S
    WOLFSTAHL, Y
    THEORETICAL COMPUTER SCIENCE, 1991, 84 (02) : 179 - 197
  • [30] Dissemination of Information in Vertex-Disjoint Paths Mode
    Hromkovic, J.
    Klasing, R.
    Stoehr, E. A.
    Computers and Artificial Intelligence, 15 (04):
12345