Spectral Generalizations of Line Graphs : On Graphs with Least Eigenvalue -2 / Dragoš Cvetkovic, Peter Rowlinson, Slobodan Simic.
Material type:
TextSeries: London Mathematical Society Lecture Note Series ; no. 314Publisher: Cambridge : Cambridge University Press, 2004Description: 1 online resource (310 pages) : digital, PDF file(s)Content type: text Media type: computer Carrier type: online resourceISBN: 9780511751752 (ebook)Subject(s): Graph theory | EigenvaluesAdditional physical formats: Print version: : No titleDDC classification: 511/.5 LOC classification: QA166 | .C837 2004Online resources: Click here to access online Summary: Line graphs have the property that their least eigenvalue is greater than or equal to –2, a property shared by generalized line graphs and a finite number of so-called exceptional graphs. This book deals with all these families of graphs in the context of their spectral properties. The authors discuss the three principal techniques that have been employed, namely 'forbidden subgraphs', 'root systems' and 'star complements'. They bring together the major results in the area, including the recent construction of all the maximal exceptional graphs. Technical descriptions of these graphs are included in the appendices, while the bibliography provides over 250 references. This will be an important resource for all researchers with an interest in algebraic graph theory.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK11962 |
Title from publisher's bibliographic system (viewed on 16 Oct 2015).
Line graphs have the property that their least eigenvalue is greater than or equal to –2, a property shared by generalized line graphs and a finite number of so-called exceptional graphs. This book deals with all these families of graphs in the context of their spectral properties. The authors discuss the three principal techniques that have been employed, namely 'forbidden subgraphs', 'root systems' and 'star complements'. They bring together the major results in the area, including the recent construction of all the maximal exceptional graphs. Technical descriptions of these graphs are included in the appendices, while the bibliography provides over 250 references. This will be an important resource for all researchers with an interest in algebraic graph theory.
There are no comments on this title.