VERTEX-DISJOINT PATHS IN CAYLEY COLOR GRAPHS

Authors
KULASINGHE P BETTAYEB S
Citation
P. Kulasinghe et S. Bettayeb, VERTEX-DISJOINT PATHS IN CAYLEY COLOR GRAPHS, Computers and artificial intelligence, 16(6), 1997, pp. 583-597
Citations number
12
Journal title
Computers and artificial intelligence → ACNP
ISSN journal
02320274
Volume
16
Issue
6
Year of publication
1997
Pages
583 - 597
Database
ISI
SICI code
0232-0274(1997)16:6<583:VPICCG>2.0.ZU;2-V
Abstract
In this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there ar e \Delta\ vertex-disjoint paths from every vertex to every other verte x in a Cayley color graph associated with a finite group Gamma and a n on redundant generating set Delta for Gamma. We also extend this resul t to a certain class of Cayley graphs.