The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
Open accessAbstract
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter.General upper bounds - called Moore bounds - for the order of such graphs and digraphs are attainable only for certain special graphs and digraphs. Finding better (tighter) upper bounds for the maximum possible number of vertices, given the other two parameters, and thus attacking the degree/diameter problem 'from above', remains a largely unexplored area. Constructions producing large graphs and digraphs of given degree and diameter represent a way of attacking the degree/diameter problem 'from below'.This survey aims to give an overview of the current state-of-the-art of the degree/diameter problem. We focus mainly on the above two streams of research. However, we could not resist mentioning also results on various related problems. These include considering Moore-like bounds for special types of graphs and digraphs, such as vertex-transitive, Cayley, planar, bipartite, and many others, on the one hand, and related properties such as connectivity, regularity, and surface embeddability, on the other hand.
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
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Bollobás, B. (1985) · Cited by 6,196
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Network structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
Reducibility Among Combinatorial Problems
Rarp, K. (2012) · Cited by 1,390
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Bruijn, D. N. D. (1946) · TU/e Research Portal · Cited by 1,289
A group-theoretic model for symmetric interconnection networks
Akers, S. B., & Krishnamurthy, B. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21148 · Cited by 1,231
Metadata
- Authors
- Miller, M., & Sirán, J.
- Venue
- The Electronic Journal of Combinatorics
- Published
- 2013-05-16
- Volume
- 1000
- ISSN
- 1077-8926 (ISSN-L)
- DOI
- 10.37236/35
- OpenAlex
- W2167990241
- Cited by
- 339
- References
- 37
- FWCI
- 37.88
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Moore Graphs and Beyond: A survey of the Degree/Diameter Problem. https://app.cochat.ai/papers/10.37236/35
- The paper
- Miller, M., & Sirán, J. (2013). Moore Graphs and Beyond: A survey of the Degree/Diameter Problem. The Electronic Journal of Combinatorics. https://doi.org/10.37236/35
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.