Nonsingular mixed graphs with few eigenvalues greater than two

Authors:
Yi-Zheng Fan;Shi-Cai Gong;Jun Zhou;Ying-Ying Tan;Yi Wang
Affiliations:
School of Mathematics and Computation Sciences, Anhui University, Hefei 230039, PR China;School of Mathematics and Computation Sciences, Anhui University, Hefei 230039, PR China;School of Mathematics and Computation Sciences, Anhui University, Hefei 230039, PR China;School of Mathematics and Computation Sciences, Anhui University, Hefei 230039, PR China;School of Mathematics and Computation Sciences, Anhui University, Hefei 230039, PR China
Venue:
European Journal of Combinatorics
Year:
2007

Citing 2
Cited 1

The Laplacian spectrum of a graph

SIAM Journal on Matrix Analysis and Applications
Graphs with fourth Laplacian eigenvalue less than two

European Journal of Combinatorics

Signless Laplacian eigenvalues and circumference of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.