The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Information processing in complex networks: Graph entropy and information functionals
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 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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Harary, F. (1969) · Cited by 10,739
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Communication Patterns in Task-Oriented Groups
Bavelas, A. (1950) · The Journal of the Acoustical Society of America · doi:10.1121/1.1906679 · Cited by 2,076
Trinajstic, N. (2018) · Routledge eBooks · doi:10.1201/9781315139111 · Cited by 1,491
Complexity, Entropy And The Physics Of Information
H. Zurek, W. (2018) · CRC Press eBooks · doi:10.1201/9780429502880 · Cited by 1,380
Cited by
Measuring user influence on Twitter: A survey
Riquelme, F., & González-Cantergiani, P. (2016) · Information Processing & Management · doi:10.1016/j.ipm.2016.04.003 · Cited by 429
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
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
Metadata
- Authors
- Dehmer, M.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2008-07
- Volume
- 201
- Issue
- 1-2
- Pages
- 82-94
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2054439077
- Cited by
- 286
- References
- 26
- FWCI
- 6.51
- 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: Information processing in complex networks: Graph entropy and information functionals. https://app.cochat.ai/papers/10.1016/j.amc.2007.12.010
- The paper
- Dehmer, M. (2008). Information processing in complex networks: Graph entropy and information functionals. Applied Mathematics and Computation. https://doi.org/10.1016/j.amc.2007.12.010
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.