The DOI matches its Crossref record.
Laplacian Eigenvectors of Graphs
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Graph Learning From Data Under Laplacian and Structural Constraints
Egilmez, H. E., Pavez, E., & Ortega, A. (2017) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2726975 · Cited by 364
The ab-initio density matrix renormalization group in practice
Olivares-Amaya, R., Hu, W., Nakatani, N., Sharma, S., Yang, J., & Chan, G. K.-L. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4905329 · Cited by 363
Abrupt transition in the structural formation of interconnected networks
Radicchi, F., & Arenas, A. (2013) · Nature Physics · doi:10.1038/nphys2761 · Cited by 348
Network Topology Inference from Spectral Templates
Segarra, S., Marques, A. G., Mateos, G., & Ribeiro, A. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2731051 · Cited by 287
Metadata
- Authors
- Biyikoğu, T., Leydold, J., & Stadler, P. F.
- Venue
- Lecture Notes in Mathematics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- ISSN
- 0075-8434 (ISSN-L)
- OpenAlex
- W2501990301
- Cited by
- 214
- References
- 0
- FWCI
- 4.27
- Type
- book
- Language
- en
- Open access
- green
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: Laplacian Eigenvectors of Graphs. https://app.cochat.ai/papers/10.1007/978-3-540-73510-6
- The paper
- Biyikoğu, T., Leydold, J., & Stadler, P. F. (2007). Laplacian Eigenvectors of Graphs. Lecture Notes in Mathematics. https://doi.org/10.1007/978-3-540-73510-6
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.