The following pages link to (Q5677530):
Displaying 50 items.
- Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree (Q298345) (← links)
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs (Q423957) (← links)
- Radial Moore graphs of radius three (Q427891) (← links)
- There are only finitely many distance-regular graphs of fixed valency greater than two (Q475256) (← links)
- On graphs with excess or defect 2 (Q476306) (← links)
- Properties of mixed Moore graphs of directed degree one (Q488273) (← links)
- On bipartite cages of excess 4 (Q521356) (← links)
- On subgraphs in distance-regular graphs (Q685995) (← links)
- New families of graphs without short cycles and large size (Q708348) (← links)
- On regular induced subgraphs of generalized polygons (Q721048) (← links)
- Improved lower bounds for the orders of even girth cages (Q727055) (← links)
- A family of mixed graphs with large order and diameter 2 (Q730485) (← links)
- On mixed Moore graphs (Q868370) (← links)
- Linear programming bounds for regular graphs (Q897255) (← links)
- A generalization of the odd-girth theorem (Q898170) (← links)
- Graphs of order two less than the Moore bound (Q924968) (← links)
- On the connectivity of \((k,g)\)-cages of even girth (Q932601) (← links)
- Search for properties of the missing Moore graph (Q962127) (← links)
- Complete catalogue of graphs of maximum degree 3 and defect at most 4 (Q967350) (← links)
- A lower bound for the spectral radius of graphs with fixed diameter (Q992783) (← links)
- Moore bound for mixed networks (Q998428) (← links)
- On the existence of graphs of diameter two and defect two (Q1025938) (← links)
- Distance-transitive graphs and generalized polygons (Q1060227) (← links)
- Trivalent orbit polynomial graphs (Q1110532) (← links)
- On finite Moore geometries (Q1133545) (← links)
- On the spectra of certain distance-regular graphs (Q1136817) (← links)
- Girth, valency, and excess (Q1143410) (← links)
- Remarks on distance-regular graphs (Q1151406) (← links)
- High density graphs for processor interconnection (Q1153674) (← links)
- Regular graphs with excess one (Q1158437) (← links)
- On the existence of certain distance-regular graphs (Q1165872) (← links)
- Graphs on alphabets as models for large interconnection networks (Q1199426) (← links)
- On the impossibility of directed Moore graphs (Q1250107) (← links)
- On symmetric Moore geometries (Q1331133) (← links)
- On the existence of radial Moore graphs for every radius and every degree (Q1631613) (← links)
- Asymptotically approaching the Moore bound for diameter three by Cayley graphs (Q1633751) (← links)
- On the non-existence of antipodal cages of even girth (Q1743143) (← links)
- Some new large compound graphs (Q1864569) (← links)
- Directed Moore hypergraphs (Q1902896) (← links)
- Maximal cubic graphs with diameter 4 (Q1975363) (← links)
- On diregular digraphs with degree two and excess three (Q2026351) (← links)
- Spectra of orders for \(k\)-regular graphs of girth \(g\) (Q2042625) (← links)
- A note on Moore Cayley digraphs (Q2051871) (← links)
- On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs (Q2111894) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- The largest Moore graph and a distance-regular graph with intersection array \(\{55, 54, 2; 1, 1, 54\}\) (Q2213942) (← links)
- On the packing chromatic number of Moore graphs (Q2217471) (← links)
- On graphs of defect at most 2 (Q2275941) (← links)
- No lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2 (Q2299613) (← links)
- Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six (Q2337023) (← links)
