Vertex-Disjoint Paths in Cayley Color Graphs

Authors

  • P. Kulasinghe
  • S. Bettayeb

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 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.

Downloads

Download data is not yet available.

Published

2012-03-05

How to Cite

Kulasinghe, P., & Bettayeb, S. (2012). Vertex-Disjoint Paths in Cayley Color Graphs. Computing and Informatics, 16(6), 583–597. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/647