The super-connected property of recursive circulant graphs

Information Processing Letters

Volumn 91, Issue 6, 2004, Pages 293-298

  Tsai, Chang Hsiung ^a   Tan, Jimmy J M ^b   Hsu, Lih Hsing ^c  

^a DAHAN INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c TA HWA INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Container; Interconnection networks; Recursive circulant; Super connected

Indexed keywords

FUNCTIONS; GRAPH THEORY; HAMILTONIANS; INTERCONNECTION NETWORKS; SET THEORY; THEOREM PROVING;

CONTAINER; MENGER'S THEOREM; RECURSIVE CIRCULANT; SUPER-CONNECTED;

DATA PROCESSING;

EID: 3943104060     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.05.013     Document Type: Article

References (8)

1. Albert M., Alderd E.R.L., Holton D., Sheehan J. On 3*-connected graphs. Australasian J. Combin. 24:2001;193-207.
2. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1980;North-Holland, Amsterdam.
3. Lim H.S., Park J.H., Chwa K.Y. Embedding trees in recursive circulants. Discrete Appl. Math. 69:1996;83-99.
4. C.K. Lin, H.M. Huang, L.H. Hsu, The super connectivity of pancake graphs and the super laceability of star graphs, manuscript.
5. Menger K. Zur allgemeinen Kurventheorie. Fund. Math. 10:1927;95-115.
6. Micheneau C. Disjoint Hamiltonian cycles in recursive circulant graphs. Inform. Process. Lett. 61:1997;259-264.
7. Park J.H., Chwa K.Y. Fundamental study recursive circulants and their embedding among hypercubes. Theoret. Comput. Sci. 244:2000;35-62.
8. Tsai C.H., Tan Jimmy J.M., Chuang Y.C., Hsu L.H. Hamiltonian properties of faulty recursive circulant graphs. J. Interconnection Networks. 3:2002;273-289.