Topological Properties of Recursive Circulants : Disjoint Cycles and Graph Invariants
Jeong-Heum Park, Gyeong-Ryong Jwa · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 1999
In this paper, we investigate recursive circulant G(2,2 ) from the graph theory point of view and present topological properties of G(2,2 ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in [10]. A necessary and sufficient condition for recursive circulant G(2,2 ) to have a cycle of length l is derived. Under the condition, we show that G(2,2 ) has the maximum possible number of vertex-disjoint cycles of length l . We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.