scientific article; zbMATH DE number 3412694
From MaRDI portal
Publication:5677530
zbMath0262.05132MaRDI QIDQ5677530
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (05C99)
Related Items
El problema de las jaulas y los polígonos generalizados, On symmetric Moore geometries, Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree, On the existence of radial Moore graphs for every radius and every degree, Unnamed Item, On the non-existence of Abelian Moore Cayley graphs with excess one, Asymptotically approaching the Moore bound for diameter three by Cayley graphs, Directed Moore hypergraphs, Trivalent orbit polynomial graphs, On mixed Moore graphs, Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter, On finite Moore geometries, On the spectra of certain distance-regular graphs, Unnamed Item, Largest regular multigraphs with three distinct eigenvalues, Improved lower bounds on the degree-diameter problem, Girth, valency, and excess, Linear programming bounds for regular graphs, On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres, A generalization of the odd-girth theorem, Graph rigidity properties of Ramanujan graphs, Unnamed Item, On abelian Cayley graphs of diameter two and defect one, On decreasing the orders of \((k,g)\)-graphs, Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs, Remarks on distance-regular graphs, Radial Moore graphs of radius three, High density graphs for processor interconnection, Regular graphs with excess one, The largest Moore graph and a distance-regular graph with intersection array \(\{55, 54, 2; 1, 1, 54\}\), On the existence of certain distance-regular graphs, On locally $GQ(s,t)$ graphs with strongly regular $\mu $-subgraphs, On the packing chromatic number of Moore graphs, Graphs of order two less than the Moore bound, Brooks' theorem on powers of graphs, There are only finitely many distance-regular graphs of fixed valency greater than two, On graphs with excess or defect 2, On the connectivity of \((k,g)\)-cages of even girth, Maximal cubic graphs with diameter 4, Properties of mixed Moore graphs of directed degree one, On the non-existence of antipodal cages of even girth, Smallest regular graphs of given degree and diameter, On subgraphs in distance-regular graphs, Graphs on alphabets as models for large interconnection networks, On bipartite cages of excess 4, Search for properties of the missing Moore graph, Complete catalogue of graphs of maximum degree 3 and defect at most 4, New families of graphs without short cycles and large size, On graphs of defect at most 2, On diregular digraphs with degree two and excess three, New largest known graphs of diameter 6, On regular induced subgraphs of generalized polygons, A lower bound for the spectral radius of graphs with fixed diameter, Improved lower bounds for the orders of even girth cages, Ranking measures for radially Moore graphs, Moore bound for mixed networks, A family of mixed graphs with large order and diameter 2, On the impossibility of directed Moore graphs, Spectra of orders for \(k\)-regular graphs of girth \(g\), Colouring graphs of bounded diameter in the absence of small cycles, No lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2, Colouring graphs of bounded diameter in the absence of small cycles, Girth-regular graphs, A note on Moore Cayley digraphs, On the existence of graphs of diameter two and defect two, Colouring H-free graphs of bounded diameter., Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six, Distance-transitive graphs and generalized polygons, Some new large compound graphs, On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs, Smallest Vertex-Transitive Graphs of Given Degree and Diameter, Cayley Graphs of Diameter Two from Difference Sets
