Article ID Journal Published Year Pages File Type
396099 Information Sciences 2007 6 Pages PDF
Abstract

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Preview
Linearly many faults in Cayley graphs generated by transposition trees
Authors
, ,