Corpus ID: 54181376

On Moore Graphs with Diameters 2 and 3

@inproceedings{AOnMG,
  title={On Moore Graphs with Diameters 2 and 3},
  author={J. A. and Ramya R.}
}

Figures from this paper

Examples of computer experimentation in algebraic combinatorics
TLDR
Certain paradigms for procuring computer-free explanations from data acquired via computer algebra experimentation are introduced, and special attention is paid to algebraic automorphisms (of a coherent algebra), a fairly new concept that has already proved to have far-reaching consequences. Expand
Algoritmos e limites para os números envoltório e de Carathéodory na convexidade P3
Nesta dissertacao, tratamos de limites para o numero envoltorio e o numero de Caratheodory na Convexidade P3. Aferimos resultados para grafos de diâmetro 2 com vertice de corte para ambos osExpand
Graph Labeling with Distance Conditions and the Delta Squared Conjecture
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highestExpand
Collapsible Graphs and Reduction of Line Graphs 1 Collapsible Graphs and Reduction of Line Graphs
A graph G is collapsible if for every even subset X ⊆ V (G), G has a spanning connected subgraph whose set of odd-degree vertices is X. A graph obtained by contracting all the nontrivial collapsibleExpand
Stability theory in finite variable logic
This thesis studies finite variable theories. To be more precise. complete Ln -theories, where Ln is the set of formulas in a first order language L in which at most n distinct variables occur. TheseExpand
C O ] 1 4 O ct 2 01 9 The missing Moore graph is really missing ∗
In this paper we propose the concept of fractal block design inspired by the geodetic properties of Moore graphs, which is a generalization of block design. As a result, we make sure that the missingExpand
Cayley Graphs of Diameter 2 from Difference Sets
TLDR
This article considers the construction of large graphs of diameter 2 using generalized difference sets and shows that ACd,2i?ź2564d2-2.1d1.525 for sufficiently large d and ACd.,2i?,ź49d2 if d=3q, q=2m and m is odd. Expand
Painting Squares in $\Delta^2-1$ Shades
TLDR
It is shown that the upper bound of Cranston and Kim's conjecture that if G is a connected graph with maximum degree and G is not a Moore Graph, then $\chi_{\ell}(G^2)\le \Delta^2-1$ is the list chromatic number holds even for online list Chromatic number. Expand
Cayley graphs of diameter two from difference sets
Let $C(d,k)$ and $AC(d,k)$ be the largest order of a Cayley graph and a Cayley graph based on an abelian group, respectively, of degree $d$ and diameter $k$. When $k=2$, it is well-known thatExpand
...
1
2
3
4
5
...