Opening book details…
Can I read The Super-connected Property of Recursive Circulant Graphs on EtoBox?
The Super-connected Property of Recursive Circulant Graphs by Chang-Hsiung Tsai; Jimmy J.M Tan; Lih-Hsing Hsu is a Computer Science article available to read on EtoBox.
What is The Super-connected Property of Recursive Circulant Graphs about?
In a graph G, a k-container C k (u, v) In this paper, we prove that the recursive circulant graphs G(2 m , 4), proposed by Park and Chwa [Theoret. Comput. Sci. 244 (2000) 35-62], are super-connected if and only if m = 2.
Who reads The Super-connected Property of Recursive Circulant Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Chang-Hsiung Tsai; Jimmy J.M Tan; Lih-Hsing Hsu
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0020-0190)
- Published
- 2004
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Chang-Hsiung Tsai; Jimmy J.M Tan; Lih-Hsing Hsu
Browse all works by Chang-Hsiung Tsai; Jimmy J.M Tan; Lih-Hsing Hsu