Topics in Algebraic Graph Theory.:
There is no other book with such a wide scope of both areas of algebraic graph theory.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge :
Cambridge University Press,
2004.
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | There is no other book with such a wide scope of both areas of algebraic graph theory. |
| Beschreibung: | 1. Introduction. |
| Beschreibung: | 1 online resource (294 pages). |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781107095847 1107095840 9781107089532 1107089530 |
Internformat
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn850148882 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 130625s2004 enk ob 001 0 eng d | ||
| 010 | |z 2004045915 | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCQ |d OCLCO |d DEBSZ |d OCLCQ |d YDXCP |d N$T |d IDEBK |d OCLCF |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d AU@ |d OCLCO |d UKAHL |d OCLCQ |d INARC |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 847526830 |a 1151434691 |a 1264920333 | ||
| 020 | |a 9781107095847 | ||
| 020 | |a 1107095840 | ||
| 020 | |a 9781107089532 |q (electronic bk.) | ||
| 020 | |a 1107089530 |q (electronic bk.) | ||
| 020 | |z 0521801974 | ||
| 020 | |z 9780521801973 | ||
| 035 | |a (OCoLC)850148882 |z (OCoLC)847526830 |z (OCoLC)1151434691 |z (OCoLC)1264920333 | ||
| 050 | 4 | |a QA166 .T64 2004 | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 082 | 7 | |a 511/.5 | |
| 084 | |a 31.12 |2 bcl | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a MAT 150f |2 stub | ||
| 084 | |a MAT 200f |2 stub | ||
| 084 | |a SK 890 |2 rvk | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Beineke, Lowell W. | |
| 245 | 1 | 0 | |a Topics in Algebraic Graph Theory. |
| 260 | |a Cambridge : |b Cambridge University Press, |c 2004. | ||
| 300 | |a 1 online resource (294 pages). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of Mathematics and its Applications ; |v v. 102 | |
| 505 | 0 | |a Cover; Topics in Algebraic Graph Theory; Series Page; Title; Copyright; Contents; Preface; Foreword; Introduction; 1. Graph theory; Graphs; Variations of graphs; Adjacency and degrees; Walks; Distance; Subgraphs; Connectedness and connectivity; Bipartite graphs; Trees; Special graphs; Operations on graphs; Traversability; Planarity; Graph colourings; Line graphs; Directed graphs; 2. Linear algebra; The space Rn; Metric properties; Vector spaces; Subspaces; Bases; Dimension; Euclidean spaces; Linear transformations; Algebra of linear transformations; The matrix of a linear transformation. | |
| 505 | 8 | |a Operations on matricesTypes of matrices; Determinants; Change of basis; Eigenvalues and eigenvectors; Diagonalizing matrices; Quadratic forms; 3. Group theory; Groups; Homomorphisms; Subgroups; Composition series; Finite simple groups; Permutation groups; Products; Automorphism groups of graphs; Orbits and stabilizers; Group actions; Transitivity; Orbitals and rank; Graphs admitting a given group; Primitivity and double transitivity; References; 1 Eigenvalues of graphs; 1. Introduction; 2. Some examples; 3. A little matrix theory; 4. Eigenvalues and walks; Strongly regular graphs. | |
| 505 | 8 | |a Distance-regular graphs5. Eigenvalues and labellings of graphs; 6. Lower bounds for the eigenvalues; 7. Upper bounds for the eigenvalues; 8. Other matrices related to graphs; 9. Cospectral graphs; Using graph operations; Pasting graphs together; References; 2 Graphs and matrices; 1. Introduction; 2. Some classical theorems; 3. Digraphs; 4. Biclique partitions of graphs; 5. Bipartite graphs; 6. Permanents; 7. Converting the permanent into the determinant; 8. Chordal graphs and perfect Gaussian elimin; 9. Ranking players in tournaments; References; 3 Spectral graph theory; 1. Introduction. | |
| 505 | 8 | |a 2. Angles3. Star sets and star partitions; 4. Star complements; 5. Exceptional graphs; 6. Reconstructing the characteristic polynomial; 7. Non-complete extended p-sums of graphs; 8. Integral graphs; References; 4 Graph Laplacians; 1. Introduction; 2. The Laplacian of a graph; 3. Laplace eigenvalues; Bounding the Laplace eigenvalues; Eigenvalues of the transition Laplacian; 4. Eigenvalues and vertex partitions of graphs; The bipartition width; 5. The max-cut problem and semi-definite programming; 6. Isoperimetric inequalities; 7. The travelling salesman problem; 8. Random walks on graphs. | |
| 505 | 8 | |a Rate of convergence of a random walkReferences; 5 Automorphisms of graphs; 1. Graph automorphisms; 2. Algorithmic aspects; 3. Automorphisms of typical graphs; 4. Permutation groups; 5. Abstract groups; 6. Cayley graphs; 7. Vertex-transitive graphs; 8. Higher symmetry; 9. Infinite graphs; 10. Graph homomorphisms; References; 6 Cayley graphs; 1. Introduction; 2. Recognition; 3. Special examples; 4. Prevalence; 5. Isomorphism; 6. Enumeration; 7. Automorphisms; 8. Subgraphs; 9. Hamiltonicity; 10. Factorization; 11. Embeddings; 12. Applications; References; 7 Finite symmetric graphs. | |
| 500 | |a 1. Introduction. | ||
| 520 | |a There is no other book with such a wide scope of both areas of algebraic graph theory. | ||
| 588 | 0 | |a Print version record. | |
| 504 | |a Includes bibliographical references and index. | ||
| 650 | 0 | |a Graph theory. |0 http://id.loc.gov/authorities/subjects/sh85056471 | |
| 650 | 6 | |a Théorie des graphes. | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a Graph theory |2 fast | |
| 650 | 7 | |a Graphentheorie |2 gnd |0 http://d-nb.info/gnd/4113782-6 | |
| 700 | 1 | |a Wilson, Robin J. | |
| 700 | 1 | |a Cameron, Peter J. | |
| 776 | 0 | 8 | |i Print version: |a Beineke, Lowell W. |t Topics in Algebraic Graph Theory. |d Cambridge : Cambridge University Press, ©2004 |z 9780521801973 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications. |0 http://id.loc.gov/authorities/names/n42010632 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569257 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH37561661 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH26478532 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1178975 | ||
| 938 | |a EBSCOhost |b EBSC |n 569257 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis25780871 | ||
| 938 | |a YBP Library Services |b YANK |n 10794861 | ||
| 938 | |a YBP Library Services |b YANK |n 10759675 | ||
| 938 | |a YBP Library Services |b YANK |n 10760954 | ||
| 938 | |a Internet Archive |b INAR |n topicsinalgebrai0000unse | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn850148882 |
|---|---|
| _version_ | 1816882236601925632 |
| adam_text | |
| any_adam_object | |
| author | Beineke, Lowell W. |
| author2 | Wilson, Robin J. Cameron, Peter J. |
| author2_role | |
| author2_variant | r j w rj rjw p j c pj pjc |
| author_facet | Beineke, Lowell W. Wilson, Robin J. Cameron, Peter J. |
| author_role | |
| author_sort | Beineke, Lowell W. |
| author_variant | l w b lw lwb |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 .T64 2004 |
| callnumber-search | QA166 .T64 2004 |
| callnumber-sort | QA 3166 T64 42004 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | MAT 055f MAT 150f MAT 200f |
| collection | ZDB-4-EBA |
| contents | Cover; Topics in Algebraic Graph Theory; Series Page; Title; Copyright; Contents; Preface; Foreword; Introduction; 1. Graph theory; Graphs; Variations of graphs; Adjacency and degrees; Walks; Distance; Subgraphs; Connectedness and connectivity; Bipartite graphs; Trees; Special graphs; Operations on graphs; Traversability; Planarity; Graph colourings; Line graphs; Directed graphs; 2. Linear algebra; The space Rn; Metric properties; Vector spaces; Subspaces; Bases; Dimension; Euclidean spaces; Linear transformations; Algebra of linear transformations; The matrix of a linear transformation. Operations on matricesTypes of matrices; Determinants; Change of basis; Eigenvalues and eigenvectors; Diagonalizing matrices; Quadratic forms; 3. Group theory; Groups; Homomorphisms; Subgroups; Composition series; Finite simple groups; Permutation groups; Products; Automorphism groups of graphs; Orbits and stabilizers; Group actions; Transitivity; Orbitals and rank; Graphs admitting a given group; Primitivity and double transitivity; References; 1 Eigenvalues of graphs; 1. Introduction; 2. Some examples; 3. A little matrix theory; 4. Eigenvalues and walks; Strongly regular graphs. Distance-regular graphs5. Eigenvalues and labellings of graphs; 6. Lower bounds for the eigenvalues; 7. Upper bounds for the eigenvalues; 8. Other matrices related to graphs; 9. Cospectral graphs; Using graph operations; Pasting graphs together; References; 2 Graphs and matrices; 1. Introduction; 2. Some classical theorems; 3. Digraphs; 4. Biclique partitions of graphs; 5. Bipartite graphs; 6. Permanents; 7. Converting the permanent into the determinant; 8. Chordal graphs and perfect Gaussian elimin; 9. Ranking players in tournaments; References; 3 Spectral graph theory; 1. Introduction. 2. Angles3. Star sets and star partitions; 4. Star complements; 5. Exceptional graphs; 6. Reconstructing the characteristic polynomial; 7. Non-complete extended p-sums of graphs; 8. Integral graphs; References; 4 Graph Laplacians; 1. Introduction; 2. The Laplacian of a graph; 3. Laplace eigenvalues; Bounding the Laplace eigenvalues; Eigenvalues of the transition Laplacian; 4. Eigenvalues and vertex partitions of graphs; The bipartition width; 5. The max-cut problem and semi-definite programming; 6. Isoperimetric inequalities; 7. The travelling salesman problem; 8. Random walks on graphs. Rate of convergence of a random walkReferences; 5 Automorphisms of graphs; 1. Graph automorphisms; 2. Algorithmic aspects; 3. Automorphisms of typical graphs; 4. Permutation groups; 5. Abstract groups; 6. Cayley graphs; 7. Vertex-transitive graphs; 8. Higher symmetry; 9. Infinite graphs; 10. Graph homomorphisms; References; 6 Cayley graphs; 1. Introduction; 2. Recognition; 3. Special examples; 4. Prevalence; 5. Isomorphism; 6. Enumeration; 7. Automorphisms; 8. Subgraphs; 9. Hamiltonicity; 10. Factorization; 11. Embeddings; 12. Applications; References; 7 Finite symmetric graphs. |
| ctrlnum | (OCoLC)850148882 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05958cam a2200769Mu 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn850148882</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|||||||||</controlfield><controlfield tag="008">130625s2004 enk ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2004045915</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">N$T</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCO</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">847526830</subfield><subfield code="a">1151434691</subfield><subfield code="a">1264920333</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107095847</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107095840</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107089532</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107089530</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521801974</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521801973</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)850148882</subfield><subfield code="z">(OCoLC)847526830</subfield><subfield code="z">(OCoLC)1151434691</subfield><subfield code="z">(OCoLC)1264920333</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166 .T64 2004</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">013000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511/.5</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.12</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 150f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 200f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beineke, Lowell W.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Topics in Algebraic Graph Theory.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2004.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (294 pages).</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Encyclopedia of Mathematics and its Applications ;</subfield><subfield code="v">v. 102</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Cover; Topics in Algebraic Graph Theory; Series Page; Title; Copyright; Contents; Preface; Foreword; Introduction; 1. Graph theory; Graphs; Variations of graphs; Adjacency and degrees; Walks; Distance; Subgraphs; Connectedness and connectivity; Bipartite graphs; Trees; Special graphs; Operations on graphs; Traversability; Planarity; Graph colourings; Line graphs; Directed graphs; 2. Linear algebra; The space Rn; Metric properties; Vector spaces; Subspaces; Bases; Dimension; Euclidean spaces; Linear transformations; Algebra of linear transformations; The matrix of a linear transformation.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Operations on matricesTypes of matrices; Determinants; Change of basis; Eigenvalues and eigenvectors; Diagonalizing matrices; Quadratic forms; 3. Group theory; Groups; Homomorphisms; Subgroups; Composition series; Finite simple groups; Permutation groups; Products; Automorphism groups of graphs; Orbits and stabilizers; Group actions; Transitivity; Orbitals and rank; Graphs admitting a given group; Primitivity and double transitivity; References; 1 Eigenvalues of graphs; 1. Introduction; 2. Some examples; 3. A little matrix theory; 4. Eigenvalues and walks; Strongly regular graphs.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Distance-regular graphs5. Eigenvalues and labellings of graphs; 6. Lower bounds for the eigenvalues; 7. Upper bounds for the eigenvalues; 8. Other matrices related to graphs; 9. Cospectral graphs; Using graph operations; Pasting graphs together; References; 2 Graphs and matrices; 1. Introduction; 2. Some classical theorems; 3. Digraphs; 4. Biclique partitions of graphs; 5. Bipartite graphs; 6. Permanents; 7. Converting the permanent into the determinant; 8. Chordal graphs and perfect Gaussian elimin; 9. Ranking players in tournaments; References; 3 Spectral graph theory; 1. Introduction.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">2. Angles3. Star sets and star partitions; 4. Star complements; 5. Exceptional graphs; 6. Reconstructing the characteristic polynomial; 7. Non-complete extended p-sums of graphs; 8. Integral graphs; References; 4 Graph Laplacians; 1. Introduction; 2. The Laplacian of a graph; 3. Laplace eigenvalues; Bounding the Laplace eigenvalues; Eigenvalues of the transition Laplacian; 4. Eigenvalues and vertex partitions of graphs; The bipartition width; 5. The max-cut problem and semi-definite programming; 6. Isoperimetric inequalities; 7. The travelling salesman problem; 8. Random walks on graphs.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Rate of convergence of a random walkReferences; 5 Automorphisms of graphs; 1. Graph automorphisms; 2. Algorithmic aspects; 3. Automorphisms of typical graphs; 4. Permutation groups; 5. Abstract groups; 6. Cayley graphs; 7. Vertex-transitive graphs; 8. Higher symmetry; 9. Infinite graphs; 10. Graph homomorphisms; References; 6 Cayley graphs; 1. Introduction; 2. Recognition; 3. Special examples; 4. Prevalence; 5. Isomorphism; 6. Enumeration; 7. Automorphisms; 8. Subgraphs; 9. Hamiltonicity; 10. Factorization; 11. Embeddings; 12. Applications; References; 7 Finite symmetric graphs.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">1. Introduction.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">There is no other book with such a wide scope of both areas of algebraic graph theory.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85056471</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des graphes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Graphic Methods.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4113782-6</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilson, Robin J.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cameron, Peter J.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Beineke, Lowell W.</subfield><subfield code="t">Topics in Algebraic Graph Theory.</subfield><subfield code="d">Cambridge : Cambridge University Press, ©2004</subfield><subfield code="z">9780521801973</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42010632</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569257</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH37561661</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH26478532</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1178975</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">569257</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis25780871</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10794861</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10759675</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10760954</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">topicsinalgebrai0000unse</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn850148882 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:25:24Z |
| institution | BVB |
| isbn | 9781107095847 1107095840 9781107089532 1107089530 |
| language | English |
| oclc_num | 850148882 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (294 pages). |
| psigel | ZDB-4-EBA |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Encyclopedia of mathematics and its applications. |
| series2 | Encyclopedia of Mathematics and its Applications ; |
| spelling | Beineke, Lowell W. Topics in Algebraic Graph Theory. Cambridge : Cambridge University Press, 2004. 1 online resource (294 pages). text txt rdacontent computer c rdamedia online resource cr rdacarrier Encyclopedia of Mathematics and its Applications ; v. 102 Cover; Topics in Algebraic Graph Theory; Series Page; Title; Copyright; Contents; Preface; Foreword; Introduction; 1. Graph theory; Graphs; Variations of graphs; Adjacency and degrees; Walks; Distance; Subgraphs; Connectedness and connectivity; Bipartite graphs; Trees; Special graphs; Operations on graphs; Traversability; Planarity; Graph colourings; Line graphs; Directed graphs; 2. Linear algebra; The space Rn; Metric properties; Vector spaces; Subspaces; Bases; Dimension; Euclidean spaces; Linear transformations; Algebra of linear transformations; The matrix of a linear transformation. Operations on matricesTypes of matrices; Determinants; Change of basis; Eigenvalues and eigenvectors; Diagonalizing matrices; Quadratic forms; 3. Group theory; Groups; Homomorphisms; Subgroups; Composition series; Finite simple groups; Permutation groups; Products; Automorphism groups of graphs; Orbits and stabilizers; Group actions; Transitivity; Orbitals and rank; Graphs admitting a given group; Primitivity and double transitivity; References; 1 Eigenvalues of graphs; 1. Introduction; 2. Some examples; 3. A little matrix theory; 4. Eigenvalues and walks; Strongly regular graphs. Distance-regular graphs5. Eigenvalues and labellings of graphs; 6. Lower bounds for the eigenvalues; 7. Upper bounds for the eigenvalues; 8. Other matrices related to graphs; 9. Cospectral graphs; Using graph operations; Pasting graphs together; References; 2 Graphs and matrices; 1. Introduction; 2. Some classical theorems; 3. Digraphs; 4. Biclique partitions of graphs; 5. Bipartite graphs; 6. Permanents; 7. Converting the permanent into the determinant; 8. Chordal graphs and perfect Gaussian elimin; 9. Ranking players in tournaments; References; 3 Spectral graph theory; 1. Introduction. 2. Angles3. Star sets and star partitions; 4. Star complements; 5. Exceptional graphs; 6. Reconstructing the characteristic polynomial; 7. Non-complete extended p-sums of graphs; 8. Integral graphs; References; 4 Graph Laplacians; 1. Introduction; 2. The Laplacian of a graph; 3. Laplace eigenvalues; Bounding the Laplace eigenvalues; Eigenvalues of the transition Laplacian; 4. Eigenvalues and vertex partitions of graphs; The bipartition width; 5. The max-cut problem and semi-definite programming; 6. Isoperimetric inequalities; 7. The travelling salesman problem; 8. Random walks on graphs. Rate of convergence of a random walkReferences; 5 Automorphisms of graphs; 1. Graph automorphisms; 2. Algorithmic aspects; 3. Automorphisms of typical graphs; 4. Permutation groups; 5. Abstract groups; 6. Cayley graphs; 7. Vertex-transitive graphs; 8. Higher symmetry; 9. Infinite graphs; 10. Graph homomorphisms; References; 6 Cayley graphs; 1. Introduction; 2. Recognition; 3. Special examples; 4. Prevalence; 5. Isomorphism; 6. Enumeration; 7. Automorphisms; 8. Subgraphs; 9. Hamiltonicity; 10. Factorization; 11. Embeddings; 12. Applications; References; 7 Finite symmetric graphs. 1. Introduction. There is no other book with such a wide scope of both areas of algebraic graph theory. Print version record. Includes bibliographical references and index. Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Théorie des graphes. MATHEMATICS Graphic Methods. bisacsh Graph theory fast Graphentheorie gnd http://d-nb.info/gnd/4113782-6 Wilson, Robin J. Cameron, Peter J. Print version: Beineke, Lowell W. Topics in Algebraic Graph Theory. Cambridge : Cambridge University Press, ©2004 9780521801973 Encyclopedia of mathematics and its applications. http://id.loc.gov/authorities/names/n42010632 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569257 Volltext |
| spellingShingle | Beineke, Lowell W. Topics in Algebraic Graph Theory. Encyclopedia of mathematics and its applications. Cover; Topics in Algebraic Graph Theory; Series Page; Title; Copyright; Contents; Preface; Foreword; Introduction; 1. Graph theory; Graphs; Variations of graphs; Adjacency and degrees; Walks; Distance; Subgraphs; Connectedness and connectivity; Bipartite graphs; Trees; Special graphs; Operations on graphs; Traversability; Planarity; Graph colourings; Line graphs; Directed graphs; 2. Linear algebra; The space Rn; Metric properties; Vector spaces; Subspaces; Bases; Dimension; Euclidean spaces; Linear transformations; Algebra of linear transformations; The matrix of a linear transformation. Operations on matricesTypes of matrices; Determinants; Change of basis; Eigenvalues and eigenvectors; Diagonalizing matrices; Quadratic forms; 3. Group theory; Groups; Homomorphisms; Subgroups; Composition series; Finite simple groups; Permutation groups; Products; Automorphism groups of graphs; Orbits and stabilizers; Group actions; Transitivity; Orbitals and rank; Graphs admitting a given group; Primitivity and double transitivity; References; 1 Eigenvalues of graphs; 1. Introduction; 2. Some examples; 3. A little matrix theory; 4. Eigenvalues and walks; Strongly regular graphs. Distance-regular graphs5. Eigenvalues and labellings of graphs; 6. Lower bounds for the eigenvalues; 7. Upper bounds for the eigenvalues; 8. Other matrices related to graphs; 9. Cospectral graphs; Using graph operations; Pasting graphs together; References; 2 Graphs and matrices; 1. Introduction; 2. Some classical theorems; 3. Digraphs; 4. Biclique partitions of graphs; 5. Bipartite graphs; 6. Permanents; 7. Converting the permanent into the determinant; 8. Chordal graphs and perfect Gaussian elimin; 9. Ranking players in tournaments; References; 3 Spectral graph theory; 1. Introduction. 2. Angles3. Star sets and star partitions; 4. Star complements; 5. Exceptional graphs; 6. Reconstructing the characteristic polynomial; 7. Non-complete extended p-sums of graphs; 8. Integral graphs; References; 4 Graph Laplacians; 1. Introduction; 2. The Laplacian of a graph; 3. Laplace eigenvalues; Bounding the Laplace eigenvalues; Eigenvalues of the transition Laplacian; 4. Eigenvalues and vertex partitions of graphs; The bipartition width; 5. The max-cut problem and semi-definite programming; 6. Isoperimetric inequalities; 7. The travelling salesman problem; 8. Random walks on graphs. Rate of convergence of a random walkReferences; 5 Automorphisms of graphs; 1. Graph automorphisms; 2. Algorithmic aspects; 3. Automorphisms of typical graphs; 4. Permutation groups; 5. Abstract groups; 6. Cayley graphs; 7. Vertex-transitive graphs; 8. Higher symmetry; 9. Infinite graphs; 10. Graph homomorphisms; References; 6 Cayley graphs; 1. Introduction; 2. Recognition; 3. Special examples; 4. Prevalence; 5. Isomorphism; 6. Enumeration; 7. Automorphisms; 8. Subgraphs; 9. Hamiltonicity; 10. Factorization; 11. Embeddings; 12. Applications; References; 7 Finite symmetric graphs. Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Théorie des graphes. MATHEMATICS Graphic Methods. bisacsh Graph theory fast Graphentheorie gnd http://d-nb.info/gnd/4113782-6 |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85056471 http://d-nb.info/gnd/4113782-6 |
| title | Topics in Algebraic Graph Theory. |
| title_auth | Topics in Algebraic Graph Theory. |
| title_exact_search | Topics in Algebraic Graph Theory. |
| title_full | Topics in Algebraic Graph Theory. |
| title_fullStr | Topics in Algebraic Graph Theory. |
| title_full_unstemmed | Topics in Algebraic Graph Theory. |
| title_short | Topics in Algebraic Graph Theory. |
| title_sort | topics in algebraic graph theory |
| topic | Graph theory. http://id.loc.gov/authorities/subjects/sh85056471 Théorie des graphes. MATHEMATICS Graphic Methods. bisacsh Graph theory fast Graphentheorie gnd http://d-nb.info/gnd/4113782-6 |
| topic_facet | Graph theory. Théorie des graphes. MATHEMATICS Graphic Methods. Graph theory Graphentheorie |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569257 |
| work_keys_str_mv | AT beinekelowellw topicsinalgebraicgraphtheory AT wilsonrobinj topicsinalgebraicgraphtheory AT cameronpeterj topicsinalgebraicgraphtheory |