Ordering trees by algebraic connectivity
Tóm tắt
Từ khóa
Tài liệu tham khảo
Anderson, W.N. Jr., Morley, T.D.: Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra18, 141–145 (1985)
Bapat, R.B.: A bound for the permanent of the Laplacian matrix. Linear Algebra Appl.74, 219–223 (1986)
Brualdi, R.A., Goldwasser, J.L.: Permanent of the Laplacian matrix of trees and bipartite graphs, Discrete Math.48, 1–21 (1984)
Constantine, G.M.: Schur convex functions on the spectra of graphs. Discrete Math.45, 181–188 (1983)
Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs. New York: Academic Press, 1979
Cvetković, D., Doob, M., Gutman, I., Torgasev, A.: Recent Results in the Theory of Graph Spectra. Amsterdam: North-Holland, 1988
Dinic, E.A., Kelmans A.K., Zaitsev, M.A.: Nonisomorphic trees with the sameT-polynomial. Inf. Process. Lett.6, 73–76 (1977)
Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J.25(100), 619–633 (1975)
Forsman, W.: Graph theory and the statistics of polymer chains. J. Chem. Physics65, 4111–4115 (1976)
Grone, R., Merris, R., Sunder, V.S.: The Laplacian spectrum of a graph, SIAM J. MATRIX ANAL.11 (1990) 218–238.
Mohar, B.: The Laplacian spectrum of graphs. Preprint series dept. math., University E.K. of Ljubljana26, 353–384 (1988)
Powers, D.L.: Tree eigenvectors, unpublished.
Vrba, A.: The permanent of the Laplacian matrix of a bipartite graph. Czech. Math. J.36(111), 7–17 (1986)