An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702): Difference between revisions
From MaRDI portal
Revision as of 17:55, 18 April 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Entropy-Based Proof for the Moore Bound for Irregular Graphs |
scientific article |
Statements
An Entropy-Based Proof for the Moore Bound for Irregular Graphs (English)
0 references
22 September 2016
0 references
girth
0 references
Moore bound
0 references
graphs
0 references
0 references
0 references
0 references
0.87439704
0 references
0.86974883
0 references
0.86887217
0 references
0 references
0 references
0.86534977
0 references