| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 469503 | Computers & Mathematics with Applications | 2009 | 4 Pages |
Abstract
The wheel graph, denoted by Wn+1Wn+1, is the graph obtained from the circuit CnCn with nn vertices by adding a new vertex and joining it to every vertex of CnCn. In this paper, the wheel graph Wn+1Wn+1, except for W7W7, is proved to be determined by its Laplacian spectrum, and a graph cospectral with the wheel graph W7W7 is given.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yuanping Zhang, Xiaogang Liu, Xuerong Yong,