Vertex-Disjoint Paths in Cayley Color Graphs
P. Kulasinghe ; S. Bettayeb
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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 1/2D1/2 vertex-disjoint paths from every vertex to every other vertex in a Cayley color graph associated with a finite group G and a non redundant generating set D for G. We also extend this result to a certain class of Cayley graphs.
Publié le : 2012-01-26
Classification:  
@article{cai647,
     author = {P. Kulasinghe and S. Bettayeb},
     title = {Vertex-Disjoint Paths in Cayley Color Graphs},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai647}
}

P. Kulasinghe; S. Bettayeb. Vertex-Disjoint Paths in Cayley Color Graphs. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai647/