On the spectral radius of the adjacency matrix and signless Laplacian matrix of a graph
暂无分享,去创建一个
Let G be a simple graph of order n. The matrix S(G)=D(G)+A(G) is called the signless Laplacian matrix of G, where D(G) and A(G) denote the diagonal matrix of vertex degrees and the adjacency matrix...
[1] P. Hansen,et al. Bounds and conjectures for the signless Laplacian index of graphs , 2009 .
[2] H. Yuan. A bound on the spectral radius of graphs , 1988 .
[3] Odile Favaron,et al. Some eigenvalue properties in graphs (conjectures of Graffiti - II) , 1993, Discret. Math..
[4] R. Merris. Laplacian matrices of graphs: a survey , 1994 .
[5] Ligong Wang,et al. Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph , 2010 .