scientific article; zbMATH DE number 3432305
From MaRDI portal
Publication:5183530
zbMath0275.05121MaRDI QIDQ5183530
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)
Related Items
Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ El problema de las jaulas y los polígonos generalizados ⋮ On symmetric Moore geometries ⋮ 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 ⋮ Some large graphs with given degree and diameter ⋮ Directed Moore hypergraphs ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ On mixed Moore graphs ⋮ On finite Moore geometries ⋮ Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ On the spectra of certain distance-regular graphs ⋮ Unnamed Item ⋮ Largest regular multigraphs with three distinct eigenvalues ⋮ Girth, valency, and excess ⋮ Linear programming bounds for regular graphs ⋮ 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 ⋮ Radial Moore graphs of radius three ⋮ High density graphs for processor interconnection ⋮ Regular graphs with excess one ⋮ Non-existence of bipartite graphs of diameter at least \(4\) and defect \(2\) ⋮ On the existence of certain distance-regular graphs ⋮ On the packing chromatic number of Moore graphs ⋮ Graphs of order two less than the Moore bound ⋮ Bipartite distance-regular graphs of valency three ⋮ 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 ⋮ The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks ⋮ 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 ⋮ Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages ⋮ Complete catalogue of graphs of maximum degree 3 and defect at most 4 ⋮ On upper bounds of odd girth cages ⋮ 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 ⋮ An alternate description of a (q + 1, 8)-cage ⋮ 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 total regularity of mixed graphs with order close to the Moore bound ⋮ On the impossibility of directed Moore graphs ⋮ Small regular graphs of girth 7 ⋮ Spectra of orders for \(k\)-regular graphs of girth \(g\) ⋮ No lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2 ⋮ Constructions of small regular bipartite graphs of girth 6 ⋮ Girth-regular graphs ⋮ A note on Moore Cayley digraphs ⋮ On bipartite graphs of defect 2 ⋮ Graphs of given degree and diameter obtained as abelian lifts of dipoles ⋮ On the existence of graphs of diameter two and defect two ⋮ The Sylvester graph and Moore graphs ⋮ Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six ⋮ A construction of small \((q-1)\)-regular graphs of girth 8 ⋮ Distance-transitive graphs and generalized polygons ⋮ Some new large compound graphs ⋮ Cayley Graphs of Diameter Two from Difference Sets
