论文信息 - On the two conjectures of Graffiti - 字舞流文

On the two conjectures of Graffiti

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

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

[3] Russell Merris,et al. Ordering trees by algebraic connectivity , 1990, Graphs Comb..

[4] Odile Favaron,et al. Some eigenvalue properties in graphs (conjectures of Graffiti - II) , 1993, Discret. Math..

[5] Russell Merris,et al. The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

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

[7] Zhang Xiaodong,et al. A new upper bound for eigenvalues of the laplacian matrix of a graph , 1997 .

[8] Simon R. Blackburn,et al. Optimal Linear Perfect Hash Families , 1998, J. Comb. Theory, Ser. A.

[9] P. Hansen,et al. Computers and discovery in algebraic graph theory , 2001 .

[10] Xiao-Dong Zhang,et al. On the Spectral Radius of Graphs with Cut Vertices , 2001, J. Comb. Theory, Ser. B.

[11] Rong Luo,et al. The spectral radius of triangle-free graphs , 2002, Australas. J Comb..

[12] On trees with perfect matchings , 2003 .

[13] K. Das. The Laplacian spectrum of a graph , 2004 .