Algebraic Graph Theory
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included at the end of each chapter, thereby covering most of the major advances in the last twenty years. Professor Biggs' basic aim remains to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first part, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject which has strong links with the 'interaction models' studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. This new and enlarged edition this will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
Pólya, G. (1937) · Acta Mathematica · doi:10.1007/bf02546665 · Cited by 1,009
On Moore Graphs with Diameters 2 and 3
Hoffman, A. J., & Singleton, R. R. (1960) · IBM Journal of Research and Development · doi:10.1147/rd.45.0497 · Cited by 489
An introduction to chromatic polynomials
Read, R. C. (1968) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(68)80087-0 · Cited by 466
The Determinant of the Adjacency Matrix of a Graph
Harary, F. (1962) · SIAM Review · doi:10.1137/1004057 · Cited by 236 · cited 1×
“2 (Harary 1962) Let A be the adjacency matrix of a graph F.”
BackgroundZur Theorie der einfach transitiven Permutationsgruppen
Wielandt, H. (1936) · Mathematische Zeitschrift · doi:10.1007/bf01218880 · Cited by 162
Strongly regular graphs with (—1,1,0) adjacency matrix having eigenvalue 3
Seidel, J. J. (1968) · Linear Algebra and its Applications · doi:10.1016/0024-3795(68)90008-6 · Cited by 160
A higher invariant for matroids
Crapo, H. H. (1967) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(67)80051-6 · Cited by 142
Intersection matrices for finite permutation groups
Higman, D. G. (1967) · Journal of Algebra · doi:10.1016/0021-8693(67)90011-7 · Cited by 129
On Minimal graphs of maximum even girth
Singleton, R. R. (1966) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(66)80054-6 · Cited by 110 · cited 1×
“For instance, a (k, 6)-graph exists if and only if there is a projective plane with k points on each line (Singleton 1966).”
BackgroundOn the action of non-Abelian groups on graphs
Watkins, M. E. (1971) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(71)90019-0 · Cited by 85
Cited by
(2008) · Journal of Machine Learning Research · Cited by 33,051
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
Metadata
- Authors
- Biggs, N.
- Affiliations
- London School of Economics and Political Science (GB)
- Corresponding author
- Biggs, Norman
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1974-05-16
- OpenAlex
- W1515707356
- Cited by
- 2,940
- References
- 19
- Citations by year
- 2026: 15 · 2025: 27 · 2024: 44 · 2023: 36 · 2022: 44 · 2021: 87 · 2020: 80 · 2019: 98 · 2018: 93 · 2017: 95 · 2016: 104 · 2015: 101 · 2014: 125 · 2013: 146 · 2012: 119
- FWCI
- 12.63
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Finite Group Theory Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- algebraic graph theory, graph spectra, adjacency matrix, incidence matrix, chromatic polynomial, interaction model, knot theory, graph symmetry, regular graphs, algebraic combinatorics, group theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algebraic Graph Theory. https://app.cochat.ai/papers/10.1017/cbo9780511608704
- The paper
- Biggs, N. (1974). Algebraic Graph Theory. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511608704
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.