On the Vertex-Disjoint Paths on Cayley Color Graphs
| dc.contributor.author | Bettayeb, Said | |
| dc.date.accessioned | 2020-05-04T16:50:42Z | |
| dc.date.available | 2020-05-04T16:50:42Z | |
| dc.date.issued | 1997 | |
| dc.description.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. | en_US |
| dc.identifier.citation | • On the Vertex-Disjoint Paths on Cayley Color Graphs, (with P. Kulasinghe), Journal Computers and Artificial Intelligence, Vol. 16 No. 6, 1997, pp. 583-597. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10657.1/2325 | |
| dc.publisher | Journal of Computers and Artificial Intelligence | en_US |
| dc.subject | Cayley color graphs, vertex-disjoint | en_US |
| dc.title | On the Vertex-Disjoint Paths on Cayley Color Graphs | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- On the Vertex-Disjoint Paths on Cayley Color Graphs.pdf
- Size:
- 6.72 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: