Moore graphs and beyond: a survey of the degree/diameter problem
From MaRDI portal
Publication:2583309
zbMath1079.05043MaRDI QIDQ2583309
Publication date: 16 January 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Surveys/index.html
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)
Related Items (93)
Eulogy for Professor Mirka Miller (1949--2016) ⋮ On the maximum order of graphs embedded in surfaces ⋮ Greedy routing in circulant networks ⋮ Mixed Moore Cayley graphs ⋮ A revised Moore bound for mixed graphs ⋮ Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree ⋮ Distant set distinguishing total colourings of graphs ⋮ On the defect of vertex-transitive graphs of given degree and diameter ⋮ On the automorphisms of a family of small q-regular graphs of girth 8 ⋮ On new record graphs close to bipartite Moore graphs ⋮ On networks with order close to the Moore bound ⋮ On the combinatorial design of data centre network topologies ⋮ Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ Distant irregularity strength of graphs ⋮ KMcube: the compound of Kautz digraph and Möbius cube ⋮ Distant set distinguishing edge colourings of graphs ⋮ Lower Bounds on Lattice Covering Densities of Simplices ⋮ Cayley graphs of diameter two and any degree with order half of the Moore bound ⋮ KCube: a novel architecture for interconnection networks ⋮ On the excess of vertex-transitive graphs of given degree and girth ⋮ Approaching the Moore bound for diameter two by Cayley graphs ⋮ Parameterized complexity of finding connected induced subgraphs ⋮ Unnamed Item ⋮ Large bipartite Cayley graphs of given degree and diameter ⋮ On girth-biregular graphs ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ The dual diameter of triangulations ⋮ The average distance and the diameter of dense random regular graphs ⋮ Radial Moore graphs of radius three ⋮ Special structures in \(\mathcal{Q}(4, q)\), projective planes and its application in \(L(h, k)\)-colorings of their Moore graphs ⋮ On digraphs of excess one ⋮ On diregular digraphs with degree two and excess two ⋮ Large circulant graphs of fixed diameter and arbitrary degree ⋮ Unnamed Item ⋮ Nonexistence of almost Moore digraphs of degrees 4 and 5 with self-repeats ⋮ The maximum degree and diameter-bounded subgraph in the mesh ⋮ Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\) ⋮ On the nonexistence of almost Moore digraphs ⋮ On the packing chromatic number of Moore graphs ⋮ Unnamed Item ⋮ Brooks' theorem on powers of graphs ⋮ On the sizes of expander graphs and minimum distances of graph codes ⋮ A lower bound for the discriminant of polynomials related to Chebyshev polynomials ⋮ Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups ⋮ Large Cayley digraphs of given degree and diameter ⋮ Digraphs with degree two and excess two are diregular ⋮ A connection between a question of Bermond and Bollobás and Ramanujan graphs ⋮ Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks ⋮ The degree-diameter problem for sparse graph classes ⋮ Unnamed Item ⋮ Smallest regular graphs of given degree and diameter ⋮ HSAGA and its application for the construction of near-Moore digraphs ⋮ Search for properties of the missing Moore graph ⋮ Constructing goal-minimally \(k\)-diametric graphs by lifts ⋮ Unnamed Item ⋮ Complete catalogue of graphs of maximum degree 3 and defect at most 4 ⋮ Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter ⋮ New improvements on connectivity of cages ⋮ Distant sum distinguishing index of graphs ⋮ Which Faber-Moore-Chen digraphs are Cayley digraphs? ⋮ Some new large (Δ, 3)‐graphs ⋮ On graphs of defect at most 2 ⋮ Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter ⋮ On diregular digraphs with degree two and excess three ⋮ New largest known graphs of diameter 6 ⋮ A spectral version of the Moore problem for bipartite regular graphs ⋮ A lower bound for the spectral radius of graphs with fixed diameter ⋮ Ranking measures for radially Moore graphs ⋮ Approximate Moore graphs are good expanders ⋮ Moore bound for mixed networks ⋮ Unnamed Item ⋮ On total regularity of mixed graphs with order close to the Moore bound ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ Large Cayley graphs of small diameter ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Witness rectangle graphs ⋮ Constructions of large graphs on surfaces ⋮ Unnamed Item ⋮ On large (Δ, D, D, 1)-graphs ⋮ On bipartite graphs of defect 2 ⋮ On large vertex-symmetric digraphs ⋮ Graphs of given degree and diameter obtained as abelian lifts of dipoles ⋮ On the existence of graphs of diameter two and defect two ⋮ Coloring Powers and Girth ⋮ Inequality and Network Formation Games ⋮ Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs ⋮ Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six ⋮ Large vertex-transitive and Cayley graphs with given degree and diameter ⋮ $t$-Strong Cliques and the Degree-Diameter Problem ⋮ Unitary Graphs ⋮ The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs ⋮ Smallest Vertex-Transitive Graphs of Given Degree and Diameter
This page was built for publication: Moore graphs and beyond: a survey of the degree/diameter problem
