The Laplacian spectrum of a mixed graph

By Xiaodong Zhang, Jiongsheng Li. 2002

49 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Two sharp upper bounds for the Laplacian eigenvalues (2004, methodology): “5 in [12].”
On weighted directed graphs (2012, background): “Zhang and Li [13], and Zhang and Luo [14] presented some upper bounds for the spectral radius and the second smallest eigenvalue of the Laplacianmatrix of a mixed graph.”
Unoriented Laplacian maximizing graphs are degree maximal (2008, background): “The concepts of oriented or unoriented Laplacian matrix for a graph have also been extended to Laplacian matrix of a mixed graph or of a signed graph (see [2,19,30,31]).”
The Laplacian eigenvalues of graphs: a survey (2011, background): “2 ([101] Let G be a simple connected graph.”
Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order (2008, background): “(The formal definition of a mixed graph as given in [11] is subject to criticism.”