| registrieren | anmelden | FAQ | [?] |
Algebraic Graph Theory(20 April 2001)
|
|
Reviews
[Write a review of this article]
There are no reviews of this article
Notes for this article
- Chapter 8 (Matrix theory) Example of cospectral non-isomorphic graphs. Spectrum determines edges and rectangles.
- Rank r implies decomposition into r-2s symmetric rank 1 matrices, s symmetric rank 2 matrices
- GF(2) rank-1 decompositions, GF(2) rank carries more information than regular rank
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
AbstractThis book is primarily aimed at graduate students and researchers in graph theory, combinatorics, or discrete mathematics in general. However, all the necessary graph theory is developed from scratch, so the only pre-requisite for reading it is a first course in linear algebra and a small amount of elementary group theory. It should be accessible to motivated upper-level undergraduates.
BibTeX record
RIS record