Affiliation:
1. Department of Mathematics and Statistics, Oakland University, Rochester, Michigan 48309, USA
Abstract
The star graph Sn, proposed by [1], has many advantages over the n-cube. It is shown in [2] that when a large number of vertices are deleted from Sn, the resulting graph can have at most two components, one of which is small. In this paper, we show that Cayley graphs generated by transpositions have this property.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献