Algebraic Graph Theory
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“A well-known observation regarding the Fiedler eigenvalue of an undirected graph is that for dense graphs is relatively large and for sparse graphs is relatively small [31].”
From Consensus Problems in Networks of Agents With Switching Topology and Time-Delays (2004) · cites this paper as [31]
In the citing paper
“For a connected graph that is undirected , the following well-known property holds [31]:”
From Consensus Problems in Networks of Agents With Switching Topology and Time-Delays (2004) · cites this paper as [31]
Citations
Cites
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Erdős, P., Ko, C., & Rado, R. (1961) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/12.1.313 · Cited by 1,705 · cited 1×
“The Erdős-Ko-Rado theorem itself ([5]) can certainly be called a seminal result, and by now there are many analogs and extensions of it which have been derived by a range of methods.”
New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
Schrijver, A. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.851748 · Cited by 246
The Erdös-Ko-Rado theorem for vector spaces
Frankl, P., & Wilson, R. (1986) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(86)90063-4 · Cited by 223
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
Gijswijt, D., Schrijver, A., & Tanaka, H. (2006) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2006.03.010 · Cited by 108
A new family of distance-regular graphs with unbounded diameter
van Dam, E., & Koolen, J. H. (2005) · Inventiones mathematicae · doi:10.1007/s00222-005-0442-3 · Cited by 74
The Connectivity of Strongly Regular Graphs
Brouwer, A. E., & Mesner, D. M. (1985) · European Journal of Combinatorics · doi:10.1016/s0195-6698(85)80030-5 · Cited by 54
The vertex-connectivity of a distance-regular graph
Brouwer, A. E., & Koolen, J. H. (2008) · European Journal of Combinatorics · doi:10.1016/j.ejc.2008.07.006 · Cited by 48
Incidence geometry from an algebraic graph theory point of view
Vanhove, F. (2011) · Ghent University Academic Bibliography (Ghent University) · Cited by 37
Cited by
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
“Notice that in Theorem 6, graph does not need to be connected.”
InfluentialConsensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
“Based on analytical tools from algebraic graph theory [23], we later show that x is a unique equilibrium of (2) (up to a constant multiplicative factor) for connected graphs.”
InfluentialCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
“A graph G is a pair ( V , E ) that consists of a set of vertices V = { 1 , 2 . . . , n } and edges E ⊆ { ( i, j ) : i, j ∈ V , j 6 = i } (i.e. the graph is in general directed and has no self-loops).”
Metadata
- Authors
- Godsil, C., & Royle, G.
- Venue
- Graduate Texts in Mathematics
- Publisher
- Springer New York
- Published
- 2001
- ISSN
- 0072-5285 (ISSN-L)
- 2197-5612
- OpenAlex
- W247697463
- Cited by
- 8,154
- References
- 8
- Citations by year
- 2026: 129 · 2025: 285 · 2024: 346 · 2023: 383 · 2022: 369 · 2021: 425 · 2020: 419 · 2019: 451 · 2018: 465 · 2017: 530 · 2016: 491 · 2015: 524 · 2014: 543 · 2013: 466 · 2012: 445
- FWCI
- 9.13
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Graduate texts in mathematics (publishedVersion)
- UWA Profiles and Research Repository (UWA) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Finite Group Theory Research
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- algebraic graph theory, transitive graphs, arc-transitive graphs, generalized polygons, Moore graphs, graph homomorphisms, Kneser graphs, matrix theory, eigenvalue interlacing, strongly regular graphs, two-graphs, line graphs, Laplacian matrix, knots, Eulerian cycles
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
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.