The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Degree-Based Topological Indices
Open accessAbstract
The degree of a vertex of a molecular graph is the number of first neighbors of this vertex.A large number of molecular-graph-based structure descriptors (topological indices) have been conceived, depending on vertex degrees.We summarize their main properties, and provide a critical comparative study thereof.(
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
Handbook of Molecular Descriptors
Todeschini, R., & Consonni, V. (2000) · Methods and Principles in Medicinal Chemistry · doi:10.1002/9783527613106 · Cited by 4,107
Molecular Descriptors for Chemoinformatics
Todeschini, R., & Consonni, V. (2009) · Methods and Principles in Medicinal Chemistry · doi:10.1002/9783527628766 · Cited by 1,746
Molecular Connectivity in Chemistry and Drug Research
(1976) · Medicinal Chemistry · doi:10.1016/b978-0-12-406560-4.x5001-6 · Cited by 1,629
Trinajstic, N. (2018) · Routledge eBooks · doi:10.1201/9781315139111 · Cited by 1,491
Topological Indices and Related Descriptors in QSAR and QSPR
(2000) · CRC Press eBooks · doi:10.1201/9781482296945 · Cited by 1,316
Vukičević, D., & Furtula, B. (2009) · Journal of Mathematical Chemistry · doi:10.1007/s10910-009-9520-x · Cited by 791
Molecular Connectivity in Structure–activity Analysis
Unger, S. H. (1987) · Journal of Pharmaceutical Sciences · doi:10.1002/jps.2600760325 · Cited by 628
Zhou, B., & Trinajstić, N. (2009) · Journal of Mathematical Chemistry · doi:10.1007/s10910-008-9515-z · Cited by 513
On general sum-connectivity index
Zhou, B., & Trinajstić, N. (2010) · Journal of Mathematical Chemistry · doi:10.1007/s10910-009-9542-4 · Cited by 477
Maximizing the sum of the squares of the degrees of a graph
Das, K. C. (2004) · Discrete Mathematics · doi:10.1016/j.disc.2004.04.007 · Cited by 213
The Zagreb coindices of graph operations
Ashrafi, A. R., Došlić, T., & Hamzeh, A. (2010) · Discrete Applied Mathematics · doi:10.1016/j.dam.2010.05.017 · Cited by 210
Pogliani, L. (2000) · Chemical Reviews · doi:10.1021/cr0004456 · Cited by 203
Graphs with maximum connectivity index
Caporossi, G., Gutman, I., Hansen, P., & Pavlović, L. (2003) · Computational Biology and Chemistry · doi:10.1016/s0097-8485(02)00016-5 · Cited by 191
Self-citationAtom–bond connectivity index of trees
Furtula, B., Graovac, A., & Vukičević, D. (2009) · Discrete Applied Mathematics · doi:10.1016/j.dam.2009.03.004 · Cited by 178
Atom-bond connectivity index of graphs
Das, K. C. (2010) · Discrete Applied Mathematics · doi:10.1016/j.dam.2010.03.006 · Cited by 143
Lučić, B., Trinajstić, N., & Zhou, B. (2009) · Chemical Physics Letters · doi:10.1016/j.cplett.2009.05.022 · Cited by 127
On atom-bond connectivity index
Das, K. C., Gutman, İ., & Furtula, B. (2011) · Chemical Physics Letters · doi:10.1016/j.cplett.2011.06.049 · Cited by 121
Self-citationOn atom–bond connectivity index of connected graphs
Xing, R., Zhou, B., & Dong, F. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.06.004 · Cited by 95
Comparison between first geometric–arithmetic index and atom-bond connectivity index
Das, K. C., & Trinajstić, N. (2010) · Chemical Physics Letters · doi:10.1016/j.cplett.2010.07.097 · Cited by 88
Yuan, Y., Zhou, B., & Trinajstić, N. (2009) · Journal of Mathematical Chemistry · doi:10.1007/s10910-009-9603-8 · Cited by 86
On the general sum-connectivity index of trees
Du, Z., Zhou, B., & Trinajstić, N. (2010) · Applied Mathematics Letters · doi:10.1016/j.aml.2010.10.038 · Cited by 80
Minimum general sum-connectivity index of unicyclic graphs
Du, Z., Zhou, B., & Trinajstić, N. (2010) · Journal of Mathematical Chemistry · doi:10.1007/s10910-010-9702-6 · Cited by 70
Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
Du, Z., Zhou, B., & Trinajstić, N. (2009) · Journal of Mathematical Chemistry · doi:10.1007/s10910-009-9604-7 · Cited by 67
On reformulated Zagreb indices
Ilić, A., & Zhou, B. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.09.021 · Cited by 63
On atom-bond connectivity index
Das, K. C., Gutman, İ., & Furtula, B. (2012) · Filomat · doi:10.2298/fil1204733d · Cited by 61
Self-citationSum-connectivity index of molecular trees
Xing, R., Zhou, B., & Trinajstić, N. (2010) · Journal of Mathematical Chemistry · doi:10.1007/s10910-010-9693-3 · Cited by 57
Some properties of the reformulated Zagreb indices
Zhou, B., & Trinajstić, N. (2010) · Journal of Mathematical Chemistry · doi:10.1007/s10910-010-9704-4 · Cited by 52
Wang, S., Zhou, B., & Trinajstić, N. (2011) · Filomat · doi:10.2298/fil1103029w · Cited by 46
Extremal trees with fixed degree sequence for atom-bond connectivity index
Xing, R., & Zhou, B. (2012) · Filomat · doi:10.2298/fil1204683x · Cited by 44
Estrada, E., & Rodríguez, L. (1999) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci990030p · Cited by 39
Sharp bounds on Zagreb indices of cacti with k pendant vertices
Li, S., Yang, H., & Zhao, Q. (2012) · Filomat · doi:10.2298/fil1206189l · Cited by 35
Vukičević, D., & Đurđević, J. (2011) · Chemical Physics Letters · doi:10.1016/j.cplett.2011.08.095 · Cited by 34
Metadata
- Authors
- Gutman, I.
- Venue
- Croatica Chemica Acta
- Publisher
- Croatian Chemical Society
- Published
- 2013
- Volume
- 86
- Issue
- 4
- Pages
- 351-361
- ISSN
- 0011-1643 (ISSN-L)
- 1334-417X
- OpenAlex
- W2080255676
- Cited by
- 863
- References
- 32
- FWCI
- 35.36
- Type
- journal article
- Language
- en
- Open access
- diamond
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.