The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Distance spectra of graphs: A survey
Open accessOverview
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,983
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
Social Network Analysis: A Handbook.
Pappi, F. U., & Scott, J. (1993) · Contemporary Sociology · doi:10.2307/2075047 · Cited by 5,969
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Handbook of Molecular Descriptors
Todeschini, R., & Consonni, V. (2000) · Methods and Principles in Medicinal Chemistry · doi:10.1002/9783527613106 · Cited by 4,107
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Brouwer, A. E., & Haemers, W. H. (2011) · Universitext · doi:10.1007/978-1-4614-1939-6_12 · Cited by 1,987
Spectra of graphs : theory and application
Cvetković, D., Doob, M., & Sachs, H. (1995) · Cited by 1,825
Brouwer, A. E., & Haemers, W. H. (2012) · Universitext · doi:10.1007/978-1-4614-1939-6 · Cited by 1,564
Phylogenomics and the reconstruction of the tree of life
Delsuc, F., Brinkmann, H., & Philippe, H. (2005) · Nature Reviews Genetics · doi:10.1038/nrg1603 · Cited by 1,236
Knoke, D., & Yang, S. (2008) · Sage eBooks · doi:10.4135/9781412985864 · Cited by 1,226
Li, M., Chen, X., Li, X., Ma, B., & Vitanyi, P. M. B. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838101 · Cited by 1,062
Deza, M. M., & Laurent, M. (1997) · Algorithms and combinatorics · doi:10.1007/978-3-642-04295-9 · Cited by 1,014
Discussion of a Set of Points in Terms of their Mutual Distances
Young, G., & Householder, A. S. (1938) · Psychometrika · doi:10.1007/bf02287916 · Cited by 753
(1990) · Choice Reviews Online · doi:10.5860/choice.28-0347 · Cited by 741
Chemical applications of graph theory
Balaban, A. T. (1976) · Cited by 529
Information theory, distance matrix, and molecular branching
Bonchev, D., & Trinajstić, N. (1977) · The Journal of Chemical Physics · doi:10.1063/1.434593 · Cited by 529
Chemical applications of graph theory
W.J.O.-T. (1977) · Journal of Molecular Structure · doi:10.1016/0022-2860(77)87052-x · Cited by 487
Schoenberg, I. J. (1935) · The Annals of Mathematics · doi:10.2307/1968654 · Cited by 453
A note on the metric properties of trees
Buneman, P. (1974) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(74)90047-1 · Cited by 329
Dress, A. (1984) · Advances in Mathematics · doi:10.1016/0001-8708(84)90029-x · Cited by 314
Global Optimization: From Theory to Implementation
(2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9 · Cited by 200
(2010) · Graph Spectra for Complex Networks · doi:10.1017/cbo9780511921681.003 · Cited by 183
So, W. (2006) · Discrete Mathematics · doi:10.1016/j.disc.2005.11.006 · Cited by 133
The distance matrix in chemistry
Mihalić, Z., Veljan, D., Amić, D., et al. (1992) · Journal of Mathematical Chemistry · doi:10.1007/bf01164206 · Cited by 132
Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors
Balaban, A. T., Ciubotariu, D., & Medeleanu, M. (1991) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00004a014 · Cited by 126
A note on the tree realizability of a distance matrix
Pereira, J. M. S. S. (1969) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(69)80092-x · Cited by 103
Free trees and bidirectional trees as representations of psychological distance
Cunningham, J. P. (1978) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(78)90029-9 · Cited by 100
Distance spectral radius of trees with fixed maximum degree
Stevanović, D., & Ilić, A. (2010) · Electronic Journal of Linear Algebra · doi:10.13001/1081-3810.1366 · Cited by 86
New Spectral Indices for Molecule Description
Consonni, V., & Todeschini, R. (2008) · BOA (University of Milano-Bicocca) · Cited by 68
Bandelt, H. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403001 · Cited by 60
Distance Realization Problems with Applications to Internet Tomography
Chung, F., Garrett, M., Graham, R. L., & Shallcross, D. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1785 · Cited by 60
On the largest eigenvalue of the distance matrix of a connected graph
Zhou, B., & Trinajstić, N. (2007) · Chemical Physics Letters · doi:10.1016/j.cplett.2007.09.048 · Cited by 56
Chemical applications of topology and group theory: 16. Forbidden coordination polyhedra
King, R. B. (1984) · Theoretical Chemistry Accounts · doi:10.1007/bf02399237 · Cited by 53
On optimal embeddings of metrics in graphs
Imrich, W., Simões-Pereira, J. M. S., & Zamfirescu, C. M. D. (1984) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(84)90009-1 · Cited by 48
Distance spectral radius of graphs with r pendent vertices
Bose, S. S., Nath, M., & Paul, S. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.04.041 · Cited by 43
Landry, P.-A., Lapointe, F., & Kirsch, J. (1996) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a025642 · Cited by 43
On optimal realizations of finite metric spaces by graphs
Althöfer, I. (1988) · Discrete & Computational Geometry · doi:10.1007/bf02187901 · Cited by 40
Submatrices of non-tree-realizable distance matrices
Simões-Pereira, J. M. S., & Zamfirescu, C. M. D. (1982) · Linear Algebra and its Applications · doi:10.1016/0024-3795(82)90001-5 · Cited by 33
The Complexity of Metric Realization
Winkler, P. M. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401051 · Cited by 19
An Optimality Criterion for Graph Embeddings of Metrics
Simões-Pereira, J. M. S. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401023 · Cited by 15
An algorithm and its role in the study of optimal graph realizations of distance matrices
Simões-Pereira, J. M. S. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90337-h · Cited by 15
A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
Simões-Pereira, J. M. S. (1984) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0605014 · Cited by 14
A note on distance matrices with unicyclic graph realizations
Simões-Pereira, J. M. S. (1987) · Discrete Mathematics · doi:10.1016/0012-365x(87)90059-8 · Cited by 14
A constructive algorithm for realizing a distance matrix
Varone, S. C. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.02.071 · Cited by 14
Trees related to realizations of distance matrices
Varone, S. C. (1998) · Discrete Mathematics · doi:10.1016/s0012-365x(98)00081-8 · Cited by 6
Metadata
- Authors
- Aouchiche, M., & Hansen, P.
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 2014-10
- Volume
- 458
- Pages
- 301-386
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2062331061
- Cited by
- 297
- References
- 48
- FWCI
- 22.08
- Type
- journal article
- Language
- en
- Open access
- bronze
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.