On Moore Graphs with Diameters 2 and 3

From MaRDI portal
Revision as of 11:14, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3275438

DOI10.1147/rd.45.0497zbMath0096.38102OpenAlexW1981159511WikidataQ29392254 ScholiaQ29392254MaRDI QIDQ3275438

Robert R. Singleton, Alan J. Hoffman

Publication date: 1960

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3e45e25c6c9404988392ae36400f6abc07019802




Related Items (only showing first 100 items - show all)

On atomic registers and randomized consensus in m\&m systems\(P_3\)-hull number of graphs with diameter twoDrawing Shortest Paths in Geodetic GraphsDomination in planar graphs with small diameter*Unnamed ItemOn the non-existence of Abelian Moore Cayley graphs with excess onePainting squares in \(\Delta^2-1\) shadesUnnamed ItemOn the spectrum and linear programming bound for hypergraphsMaximal triangle‐free graphs with restrictions on the degreesCovers of complete graphs and related association schemesON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHSOn the impossibility to construct certain classes of graphs by extensionsStrongly regular configurationsCOMMON NEIGHBOR POLYNOMIAL OF SOME DENDRIMER STRUCTURESNew small regular graphs of girth 5On networks with order close to the Moore boundColouring generalized claw-free graphs and graphs of large girth: bounding the diameterExtremal Betti numbers of symbolic powers of two-dimensional squarefree monomial idealsGraphs derived from perfect difference setsGraph \(r\)-hued colorings -- a surveyImproved upper and lower bounds fork-broadcastingFactorizations of Almost Simple Groups with a Solvable Factor, and Cayley Graphs of Solvable GroupsMoore Graphs and Cycles Are Extremal Graphs for Convex CyclesA survey on the missing Moore graphUnnamed ItemLargest regular multigraphs with three distinct eigenvaluesImproved lower bounds on the degree-diameter problemOn the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheresUnnamed ItemThe average distance and the diameter of dense random regular graphsUnnamed ItemGraphs with three distinct distance eigenvaluesUnnamed ItemPacking in regular graphsUnnamed ItemA lower bound for the discriminant of polynomials related to Chebyshev polynomialsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsThe nonexistence of Moore geometries of diameter 4Unnamed ItemSmallest regular graphs of given degree and diameterOn the maximum cocliques of the rank 3 graph of 211:M24An Alternative Way to Generalize the PentagonGeodetic graphs of diameter twoStructural properties of graphs of diameter 2 with maximal repeatsTotally chiral maps and hypermaps of small genusOn reverse degree distanceA bibliography of graph equationsRegular graphs of girth 5 from elliptic semiplanes of type \(C\)Some new large (Δ, 3)‐graphsOn graphs of defect at most 2On diregular digraphs with degree two and excess threeNew largest known graphs of diameter 6Parameterized verification of coverability in infinite state broadcast networksRanking measures for radially Moore graphsApproximate Moore graphs are good expandersCondensed Ricci curvature of complete and strongly regular graphsOn total regularity of mixed graphs with order close to the Moore boundOn the integrability of strongly regular graphsNo lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2Sesqui-arrays, a generalisation of triple arraysA note on Moore Cayley digraphsMaximizing the Order of a Regular Graph of Given Valency and Second EigenvalueOn large (Δ, D, D, 1)-graphsOn \(k\)-connected-homogeneous graphsA generalization of Moore graphs of diameter twoUnnamed ItemUnnamed ItemOn the weak distance-regularity of Moore-type digraphsCubic edge-transitive bi-Cayley graphs over inner-abelian p-groupsA generalization of the matrix equation \(A^ 2=J\)The Sylvester graph and Moore graphsColouring H-free graphs of bounded diameter.On the impossibility of certain Moore graphsOn a graph of Hoffman and SingletonImproving bounds on the order of regular graphs of girth 5Graphs and finite permutation groupsIntersection properties of finite setsFrames over finite fields: equiangular lines in orthogonal geometryA smallest graph of girth 5 and valency 5Strengthening the Murty-Simon conjecture on diameter 2 critical graphsDoubly primitive vertex stabilisers in graphsAntipodal covering graphsAn algebraic approach to lifts of digraphsOn the extremal eccentric connectivity index of graphsRainbow connectivity using a rank genetic algorithm: Moore cages with girth sixUnnamed ItemGraph metric with no proper inclusion between linesA sharp lower bound for the spectral radius in \(K_4\)-saturated graphsConditions for invariance of set diameters under d-convexification in a graphDrawing Shortest Paths in Geodetic GraphsA note on large Cayley graphs of diameter two and given degreeOn the conditional edge connectivity of double-orbit graphsLargest Graphs of Diameter 2 and Maximum Degree 6On upper bounds and connectivity of cagesConnectedness strength of two vertices in an uncertain graphTotal Domination in Graphs with Diameter 2Smallest Vertex-Transitive Graphs of Given Degree and DiameterTrade-offs among degree, diameter, and number of pathsCayley Graphs of Diameter Two from Difference Sets




This page was built for publication: On Moore Graphs with Diameters 2 and 3