References
- Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 1994;197(198):143–176.
- Kirkland SJ, Neumann M, Shader BL. Distances in weighted trees and group inverses of Laplacian matrices. SIAM J Matrix Anal Appl. 1997;18(4):827–841.
- Kirkland SJ, Molitierno JJ, Neumann M, et al. On graphs with equal algebraic and vertex connectivity. Linear Algebra Appl. 2002;341:45–56.
- Kirkland SJ, Neumann M. On the algebraic connectivity as a function of an edge weight. Linear Multilinear Algebra. 2004;52:17–33.
- Godsill C, Royle G. Algebraic graph theory. New York (NY): Springer-Verlag; 2001.
- Delsarte Ph. An algebraic approach to the association schemes of coding theory. Philips Res Rep Suppl. 1973;10:1–97.
- van Lint JH, Wilson RM. A course in combinatorics. 2nd ed. Cambridge: Cambirdge University Press; 2001.
- Fallat S, Kirkland SJ. Extremizing algebraic connectivity subject to graph theoretic constraints. Electron J Linear Algebra. 1998;3:48–74.
- Kirkland SJ, Neumann M, Shader BL. Characteristic vertices of weighted tree via Perron values. SIAM Linear Multilinear Algebra. 1996;40:311–325.
- Berman A, Plemmons RJ. Nonnegative matrices in the mathematical sciences. Philadelphia (PA): SIAM; 1994.
- Chaiken S, Kleitman DJ. Matrix tree theorems. J Comb Theory Ser A. 1978;24:377–381.
- Horn RA, Johnson CR. Matrix analysis. Cambridge: Cambridge University Press; 1985.
- Bannai E, Ito T. Association schemes. Menlo Park (CA): Benjamin/Cummings; 1984.