Metraipolis › archive › dc_79029b2e2602
Table of the largest known graphs of a given diameter and maximal degree — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T18:59:17.021Z
- SHA-256 of the archived text
df38160ac332b4ee079b0206c563cca2767dd18f51c4b338df7ff7a5ef5e4f8a- Stable URL of this page
https://metraipolis.com/documento/dc_79029b2e2602
How to cite
Table of the largest known graphs of a given diameter and maximal degree — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_79029b2e2602 (Metraipolis archive dc_79029b2e2602, sha256 df38160ac332b4ee079b0206c563cca2767dd18f51c4b338df7ff7a5ef5e4f8a)
BibTeX
@misc{dc79029b2e2602,
title = {Table of the largest known graphs of a given diameter and maximal degree — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_79029b2e2602; sha256 df38160ac332b4ee079b0206c563cca2767dd18f51c4b338df7ff7a5ef5e4f8a},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer. The table below gives current progress on this problem (excluding the case of degree 2, where the largest graphs are cycles with an odd number of vertices). Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»). Fonte: Wikipedia in inglese, voce «Table of the largest known graphs of a given diameter and maximal degree» — https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree Wikidata Q7673253 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7673253 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1380229983, consultata il 2026-10-15T18:21:55.018Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ce882b1957fa8d66db7717bb1a53a54581fb28db69bd6494b6d41d5b4517d892