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.

[1]  Yi-Zheng Fan,et al.  On the least eigenvalue of a unicyclic mixed graph , 2005 .

[2]  Xiao-Dong Zhang.  Graphs with fourth Laplacian eigenvalue less than two , 2003, Eur. J. Comb..

[3]  FanYizheng.  LARGEST EIGENVALUE OF A UNICYCLIC MIXED GRAPH , 2004 .

[4]  Xiaodong Zhang,et al.  The Laplacian spectrum of a mixed graph , 2002 .

[5]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[6]  B. Mohar.  Some applications of Laplace eigenvalues of graphs , 1997 .

[7]  Yi-Zheng Fan,et al.  On graphs with small number of Laplacian eigenvalues greater than two , 2003 .

[8]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[9]  Jerrold W. Grossman,et al.  Edge version of the matrix tree theorem for trees , 2000 .

[10]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[11]  Guo Ji Ming,et al.  A relation between the matching number and Laplacian spectrum of a graph , 2001 .

[12]  Yi-Zheng Fan,et al.  On spectral integral variations of mixed graphs , 2003 .

[13]  V. Sunder,et al.  The Laplacian spectrum of a graph , 1990 .

[14]  Miroslav Petrović,et al.  On graphs with at most three Laplacian eigenvalues greater than or equal to two , 2004 .

[15]  R. Bapat,et al.  Generalized matrix tree theorem for mixed graphs , 1999 .

[16]  Xiao-Dong Zhang.  Bipartite graphs with small third Laplacian eigenvalue , 2004, Discret. Math..

[17]  Xiao-Dong Zhang,et al.  The Laplacian eigenvalues of mixed graphs , 2003 .

[18]  Mirko Lepovic,et al.  On bipartite graphs with small number of laplacian eigenvalues greater than two and three , 2000 .