The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Eigenvalues, diameter, and mean distance in graphs
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
Cites
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
cacute, C., Vs, M., Doob, M., & Sachs, H. (1980) · Cited by 1,478
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Self-citationA property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
Isoperimetric numbers of graphs
Mohar, B. (1989) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(89)90029-4 · Cited by 331
Self-citationChung, F. (1989) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1989-0965008-x · Cited by 252
Explicit Concentrators from Generalized N-Gons
Tanner, R. M. (1984) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0605030 · Cited by 247
Characteristic vertices of trees*
Merris, R. (1987) · Linear and Multilinear Algebra · doi:10.1080/03081088708817827 · Cited by 101
Cited by
Synchronization in complex networks
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., & Zhou, C. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.002 · Cited by 3,713
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Metadata
- Authors
- Mohar, B.
- Venue
- Graphs and Combinatorics
- Published
- 1991-03
- Volume
- 7
- Issue
- 1
- Pages
- 53-64
- ISSN
- 0911-0119 (ISSN-L)
- 1435-5914
- OpenAlex
- W1984732727
- Cited by
- 301
- References
- 10
- FWCI
- 4.96
- Type
- journal article
- 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: Eigenvalues, diameter, and mean distance in graphs. https://app.cochat.ai/papers/10.1007/bf01789463
- The paper
- Mohar, B. (1991). Eigenvalues, diameter, and mean distance in graphs. Graphs and Combinatorics. https://doi.org/10.1007/bf01789463
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.
