Laplacian matrices of graphs: a survey Export

@article{Merris, abstract = {Let G be a graph on n vertices. Its Laplacian matrix is the n-by-n matrix L(G)=D(G)-A(G), where A(G) is the familiar (0,1) adjacency matrix, and D(G) is the diagonal matrix of vertex degrees. This is primarily an expository article surveying some of the many results known for Laplacian matrices. Its six sections are: Introduction, The Spectrum, The Algebraic Connectivity, Congruence and Equivalence, Chemical Applications, and Immanants.}, author = {Merris, Russell}, citeulike-article-id = {2219224}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/0024-3795(94)90486-3}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/0024-3795(94)90486-3}, citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6V0R-463GRK0-W/2/7d31a77600a1eec226ffde2b36e54094}, doi = {10.1016/0024-3795(94)90486-3}, journal = {Linear Algebra and its Applications}, keywords = {graph\_theory}, month = {}, pages = {143--176}, posted-at = {2009-05-12 02:43:07}, priority = {2}, title = {Laplacian matrices of graphs: a survey}, url = {http://dx.doi.org/10.1016/0024-3795(94)90486-3}, volume = {197-198}, year = {1994} }

TY - JOUR ID - Merris L3 - citeulike-article-id:2219224 N2 - Let G be a graph on n vertices. Its Laplacian matrix is the n-by-n matrix L(G)=D(G)-A(G), where A(G) is the familiar (0,1) adjacency matrix, and D(G) is the diagonal matrix of vertex degrees. This is primarily an expository article surveying some of the many results known for Laplacian matrices. Its six sections are: Introduction, The Spectrum, The Algebraic Connectivity, Congruence and Equivalence, Chemical Applications, and Immanants. JF - Linear Algebra and its Applications EP - 176 TI - Laplacian matrices of graphs: a survey VL - 197-198 SP - 143 KW - graph_theory AU - Merris, Russell PY - 1994/0// UR - http://dx.doi.org/10.1016/0024-3795(94)90486-3 ER -