The DOI matches its Crossref record.
Eigenspaces of Graphs
Abstract
Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labelling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. One objective is to describe graphs by algebraic means as far as possible, and the book discusses the Ulam reconstruction conjecture and the graph isomorphism problem in this context. Further problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Who's Who in Networks. Wanted: The Key Player
Ballester, C., Calvó-Armengol, A., & Zenou, Y. (2006) · Econometrica · doi:10.1111/j.1468-0262.2006.00709.x · Cited by 1,291
Communicability in complex networks
Estrada, E., & Hatano, N. (2008) · Physical Review E · doi:10.1103/physreve.77.036111 · Cited by 719
Randomizing Social Networks: a Spectrum Preserving Approach
Ying, X., & Wu, X. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.67 · Cited by 311
Towards a spectral theory of graphs based on the signless Laplacian, I
Cvetkovic, D., & Simic, S. (2009) · Publications de l'Institut Mathematique · doi:10.2298/pim0999019c · Cited by 280
Self-citation
Metadata
- Authors
- Cvetkovic, D., Rowlinson, P., & Simic, S.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1997-01-09
- OpenAlex
- W1608618407
- Cited by
- 531
- References
- 0
- FWCI
- 2.66
- Type
- book
- Language
- en
- Open access
- closed
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: Eigenspaces of Graphs. https://app.cochat.ai/papers/10.1017/cbo9781139086547
- The paper
- Cvetkovic, D., Rowlinson, P., & Simic, S. (1997). Eigenspaces of Graphs. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781139086547
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.