| Record ID | marc_columbia/Columbia-extract-20221130-003.mrc:461730000:1839 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-003.mrc:461730000:1839?format=raw |
LEADER: 01839mam a2200301 a 4500
001 1495212
005 20220602045507.0
008 940510s1993 enk b 001 0 eng d
020 $a0521458978
035 $a(OCoLC)ocm30411209
035 $9AJD6474CU
035 $a(NNC)1495212
035 $a1495212
040 $aRCE$cRCE
100 1 $aBiggs, Norman.$0http://id.loc.gov/authorities/names/n50011216
245 10 $aAlgebraic graph theory /$cNorman Biggs.
250 $a2nd. ed.
260 $aCambridge :$bCambridge University Press,$c1993.
300 $avi, 205 ;$c23 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $aunspecified$2rdacarrier
490 1 $aCambridge mathematical library
504 $aIncludes bibliographical references (p. [191]-201) and index.
505 0 $a1. Introduction -- Pt. 1. Linear Algebra in Graph Theory. 2. The spectrum of a graph. 3. Regular graphs and line graphs. 4. Cycles and cuts. 5. Spanning trees and associated structures. 6. The tree-number. 7. Determinant expansions. 8. Vertex-partitions and the spectrum -- Pt. 2. Colouring Problems. 9. The chromatic polynomial. 10. Subgraph expansions. 11. The multiplicative expansion. 12. The induced subgraph expansion. 13. The Tutte polynomial. 14. Chromatic polynomials and spanning trees -- Pt. 3. Symmetry and Regulation. 15. Automorphisms of graphs. 16. Vertex-transitive graphs. 17. Symmetric graphs. 18. Symmetric graphs of degree three. 19. The covering-graph construction. 20. Distance-transitive graphs. 21. Feasibility of intersection arrays. 22. Imprimitivity. 23. Minimal regular graphs with given girth.
650 0 $aGraph theory.$0http://id.loc.gov/authorities/subjects/sh85056471
830 0 $aCambridge mathematical library.$0http://id.loc.gov/authorities/names/n88500937
852 00 $bmat$hQA166$i.B53 1993