The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
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
Ryser, H. (1963) · Carus Mathematical Monographs · doi:10.5948/upo9781614440147 · Cited by 969
Life, information theory, and topology
Rashevsky, N. (1955) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02477860 · Cited by 427
A note on the information content of graphs
Trucco, E. (1956) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02477836 · Cited by 218
Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
Mowshowitz, A. (1968) · Bulletin of Mathematical Biology · doi:10.1007/bf02476692 · Cited by 121
Self-citationEntropy and the complexity of graphs: IV. Entropy measures and graphical structure
Mowshowitz, A. (1968) · Bulletin of Mathematical Biology · doi:10.1007/bf02476673 · Cited by 88
Self-citationEntropy and the complexity of graphs: III. Graphs with prescribed information content
Mowshowitz, A. (1968) · Bulletin of Mathematical Biology · doi:10.1007/bf02476603 · Cited by 86
Self-citation
Cited by
A history of graph entropy measures
Dehmer, M., & Mowshowitz, A. (2011) · Information Sciences · doi:10.1016/j.ins.2010.08.041 · Cited by 565
Self-citationInformation theory, distance matrix, and molecular branching
Bonchev, D., & Trinajstić, N. (1977) · The Journal of Chemical Physics · doi:10.1063/1.434593 · Cited by 529
Information processing in complex networks: Graph entropy and information functionals
Dehmer, M. (2008) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.12.010 · Cited by 286
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
Metadata
- Authors
- Mowshowitz, A.
- Venue
- The Bulletin of Mathematical Biophysics
- Published
- 1968-03
- Volume
- 30
- Issue
- 1
- Pages
- 175-204
- ISSN
- 0092-8240 (ISSN-L)
- 0007-4985
- 1522-9602
- OpenAlex
- W2321047733
- Cited by
- 330
- References
- 6
- FWCI
- 3.62
- 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
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.