Nonsingular mixed graphs with few eigenvalues greater than two

Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mixed graphs G with exactly one Laplacian eigenvalue greater than 2 are also characterized. c 2006 Elsevier Ltd. All rights reserved.

• Type: Journal
• Year: 2007
• Where: EJC
• Authors: Yi-Zheng Fan, Shi-Cai Gong, Jun Zhou, Ying-Ying Tan, Yi Wang
• Keywords: EJC 2007, Information Technology, Laplacian Eigenvalue, Mixed Graphs, Nonsingular