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
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
Lakshmivarahan, S., Jwo, J.-S., & Dhall, S. K. (1993) · Parallel Computing · doi:10.1016/0167-8191(93)90054-o · Cited by 327
Chung, F. (1989) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1989-0965008-x · Cited by 252
The Non-Existence of Finite Projective Planes of Order 10
Lam, C. W. H., Thiel, L., & Swiercz, S. (1989) · Canadian Journal of Mathematics · doi:10.4153/cjm-1989-049-4 · Cited by 220
Line Digraph Iterations and the (d, k) Digraph Problem
Fiol, M. À., Yebra, & Miquel, D. (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676455 · Cited by 209
The Moore Bound for Irregular Graphs
Alon, N., Hoory, S., & Linial, N. (2002) · Graphs and Combinatorics · doi:10.1007/s003730200002 · Cited by 198
Wong, P. (1982) · Journal of Graph Theory · doi:10.1002/jgt.3190060103 · Cited by 180
Strategies for interconnection networks: Some methods from graph theory
Bermond, J. C., Delorme, C., & Quisquater, J.-J. (1986) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(86)90008-0 · Cited by 154
Fabrega, J. M., & Fiol, M. À. (1989) · Journal of Graph Theory · doi:10.1002/jgt.3190130603 · Cited by 136
On Minimal graphs of maximum even girth
Singleton, R. R. (1966) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(66)80054-6 · Cited by 110
Interconnection Networks Based on a Generalization of Cube-Connected Cycles
Carlsson, Cruthirds, Sexton, & Wright (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.1676627 · Cited by 72
Large bipartite graphs with given degree and diameter
Delorme, C. (1985) · Journal of Graph Theory · doi:10.1002/jgt.3190090304 · Cited by 55
Regular graphs with excess one
Bannaĭ, E., & Ito, T. (1981) · Discrete Mathematics · doi:10.1016/0012-365x(81)90215-6 · Cited by 53
New results for the degree/diameter problem
Dinneen, M. J., & Hafner, P. R. (1994) · Networks · doi:10.1002/net.3230240702 · Cited by 41
Grands Graphes de Degré et Diamètre Donnés
Delorme, C. (1985) · European Journal of Combinatorics · doi:10.1016/s0195-6698(85)80043-3 · Cited by 37
Fiol, M. À., & Yebra, J. L. A. (1990) · Journal of Graph Theory · doi:10.1002/jgt.3190140608 · Cited by 37
The connectivity of large digraphs and graphs
Fiol, M. À. (1993) · Journal of Graph Theory · doi:10.1002/jgt.3190170105 · Cited by 34
Graphs with even girth and small excess
Biggs, N. L., & Ito, T. (1980) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100057303 · Cited by 33
Small diameter symmetric networks from linear groups
Campbell, L., Carlsson, G., Dinneen, M. J., Faber, V., Fellows, M. R., Langston, M. A., Moore, J. W., Mullhaupt, A. P., & Sexton, H. B. (1992) · IEEE Transactions on Computers · doi:10.1109/12.123397 · Cited by 32
Tables of large graphs wh given degree and diameter
Bermond, J. C., Delorme, C., & Quisquater, J.-J. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90076-x · Cited by 30
Vertex-symmetric generalized Moore graphs
Sampels, M. (2003) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(03)00294-4 · Cited by 27
Large Graphs with Given Degree and Diameter III
Bermond, J. C., Delorme, C., & Farhi, G. (1982) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73544-8 · Cited by 26
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Branković, L., Miller, M., Plesník, J., Ryan, J., & Širáň, J. (1997) · The Electronic Journal of Combinatorics · doi:10.37236/1347 · Cited by 26
Self-citationFurther mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
Xiao, W., & Parhami, B. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.04.002 · Cited by 22
The existence of symmetric block designs
Ryser, H. J. (1982) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(82)90068-1 · Cited by 20
Jørgensen, L. K. (1992) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)90144-y · Cited by 19
A Kautz-based Real-Time and Energy-Efficient Wireless Sensor and Actuator Network
Li, Z., & Shen, H. (2012) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2012.43 · Cited by 7
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
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.