Spectra of Graphs: Theory and Applications, 3rd Revised and Enlarged Edition

@book{citeulike:2320553, abstract = {{The theory of graph spectra can, in a way, be considered as an attempt to utilize linear algebra including, in particular, the well-developed theory of matrices for the purposes of graph theory and its applications. However, that does not mean that the theory of graph spectra can be reduced to the theory of matrices; on the contrary, it has its own characteristic features and specific ways of reasoning fully justifying it to be treated as a theory in its own right.}}, author = {Cvetkovic, Dragos M. and Doob, Michael and Sachs, Horst and Cvetkovi\&cacute, M. and Horstlistprice:}, citeulike-article-id = {2320553}, comment = {* cited by Balasubramanian * p.44(23) Thm 1.10 number of walks in terms of rank-1 decomposition * p.45(23) formula (1.59) -- walk generating function from characteristic polynomial (qr/walk-generating-function) * p.81(41) number of closed walks * p.209(105) decomposition formulas for walk generating function (direct sum means put 2 graphs together without connections) * sec.7.5 p.214(108) finds number of walks for various graphs, closed form expression for number of walks in a chain}, howpublished = {Hardcover}, isbn = {3527296859}, keywords = {book, graph-theory, spectral, walks}, month = {December}, posted-at = {2008-02-01 21:04:19}, priority = {2}, publisher = {{Vch Verlagsgesellschaft Mbh}}, title = {Spectra of Graphs: Theory and Applications, 3rd Revised and Enlarged Edition}, url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&path=ASIN/3527296859}, year = {1998} }

TY - BOOK ID - citeulike:2320553 L3 - citeulike-article-id:2320553 TI - Spectra of Graphs: Theory and Applications, 3rd Revised and Enlarged Edition PB - {Vch Verlagsgesellschaft Mbh} SN - 3527296859 N2 - {The theory of graph spectra can, in a way, be considered as an attempt to utilize linear algebra including, in particular, the well-developed theory of matrices for the purposes of graph theory and its applications. However, that does not mean that the theory of graph spectra can be reduced to the theory of matrices; on the contrary, it has its own characteristic features and specific ways of reasoning fully justifying it to be treated as a theory in its own right.} KW - book KW - graph-theory KW - spectral KW - walks N1 - * cited by Balasubramanian * p.44(23) Thm 1.10 number of walks in terms of rank-1 decomposition * p.45(23) formula (1.59) -- walk generating function from characteristic polynomial (qr/walk-generating-function) * p.81(41) number of closed walks * p.209(105) decomposition formulas for walk generating function (direct sum means put 2 graphs together without connections) * sec.7.5 p.214(108) finds number of walks for various graphs, closed form expression for number of walks in a chain AU - Cvetkovic, Dragos AU - Doob, Michael AU - Sachs, Horst AU - Cvetkovi&cacute, M AU - Horstlistprice: PY - 1998/12/23/ UR - http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/3527296859 ER -