The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A history of graph entropy measures
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Handbook of Molecular Descriptors
Todeschini, R., & Consonni, V. (2000) · Methods and Principles in Medicinal Chemistry · doi:10.1002/9783527613106 · Cited by 4,107 · cited 4×
“As in applications in mathematical chemistry [11,35,85], graph entropy measures were found to be the best measures to distinguish non-isomorphic process graphs uniquely [16].”
BackgroundInfluentialDorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Entropy measures for networks: Toward an information theory of complex topologies
Anand, K., & Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.80.045102 · Cited by 368
Entropy Bounds for Hierarchical Molecular Networks
Dehmer, M., Borgert, S., & Emmert-Streib, F. (2008) · PLoS ONE · doi:10.1371/journal.pone.0003079 · Cited by 40
Self-citation
Cited by
Structural Information and Dynamical Complexity of Networks
Li, A., & Pan, Y. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555904 · Cited by 200
Using entropy measures for comparison of software traces
Miranskyy, A. V., Davison, M., Reesor, R. M., & Murtaza, S. S. (2012) · Information Sciences · doi:10.1016/j.ins.2012.03.017 · Cited by 27
Metadata
- Authors
- Dehmer, M., & Mowshowitz, A.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2011-01
- Volume
- 181
- Issue
- 1
- Pages
- 57-78
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2091613287
- Cited by
- 565
- References
- 7
- FWCI
- 28.49
- 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: A history of graph entropy measures. https://app.cochat.ai/papers/10.1016/j.ins.2010.08.041
- The paper
- Dehmer, M., & Mowshowitz, A. (2011). A history of graph entropy measures. Information Sciences. https://doi.org/10.1016/j.ins.2010.08.041
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.
