The Wide-Diameter of Circulant Graph of Degree 4
- Received Date: 2004-05-21
- Publish Date: 2006-08-15
-
Key words:
- wide-distance /
- wide-diameter /
- circulant graph /
- isomorphic graph
Abstract: The wide-distance and wide-diameter of a graph G containing disjoint paths between two vertices of G are studied. Some characterizes of the circulant graphs with order n and degree 4 are given by symmetry of the circulant graphs. Some upper and lower bounds of wide diameter of the circulant graphs of degree 4 are also obtained. The results can be used to measure the transmission delay and fault of a class of symmetric interconnection network which is modeled as a circulant graph.
Citation: | JIANG Xiao-ping, ZHANG Xian-di. The Wide-Diameter of Circulant Graph of Degree 4[J]. Journal of University of Electronic Science and Technology of China, 2006, 35(4): 560-563. |