Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn explicit formula for obtaining $(q+1,8)$-cages and others small regular graphs of girth 8
130
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $q$ be a prime power; $(q+1,8)$-cages have been constructed as incidence graphs of a non-degenerate quadric surface in projective 4-space $P(4, q)$. The first contribution of this paper is a construction of these graphs in an alternative way by means of an explicit formula using graphical terminology. Furthermore by removing some specific perfect dominating sets from a $(q+1,8)$-cage we derive $k$-regular graphs of girth 8 for $k= q-1$ and $k=q$, having the smallest number of vertices known so far.
rate research
Read More
In this note we construct a new infinite family of $(q-1)$-regular graphs of girth $8$ and order $2q(q-1)^2$ for all prime powers $qge 16$, which are the smallest known so far whenever $q-1$ is not a prime power or a prime power plus one itself.
The first known families of cages arised from the incidence graphs of generalized polygons of order $q$, $q$ a prime power. In particular, $(q+1,6)$--cages have been obtained from the projective planes of order $q$. Morever, infinite families of small regular graphs of girth 5 have been constructed performing algebraic operations on $mathbb{F}_q$. In this paper, we introduce some combinatorial operations to construct new infinite families of small regular graphs of girth 7 from the $(q+1,8)$--cages arising from the generalized quadrangles of order $q$, $q$ a prime power.
In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic semiplane of type ${cal C}$. We also obtain a 13-regular graph of girth 5 on 236 vertices from $B_{11}$ using the same technique.
In this paper we are interested in the {it{Cage Problem}} that consists in constructing regular graphs of given girth $g$ and minimum order. We focus on girth $g=5$, where cages are known only for degrees $k le 7$. We construct regular graphs of girth $5$ using techniques exposed by Funk [Note di Matematica. 29 suppl.1, (2009) 91 - 114] and Abreu et al. [Discrete Math. 312 (2012), 2832 - 2842] to obtain the best upper bounds known hitherto. The tables given in the introduction show the improvements obtained with our results.
Let $2 le r < m$ and $g$ be positive integers. An $({r,m};g)$--graph} (or biregular graph) is a graph with degree set ${r,m}$ and girth $g$, and an $({r,m};g)$-cage (or biregular cage) is an $({r,m};g)$-graph of minimum order $n({r,m};g)$. If $m=r+1$, an $({r,m};g)$-cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from M. Abreu, G. Araujo-Pardo, C. Balbuena, D. Labbate (2011) on the incidence graphs of an affine and a biaffine plane obtaining two new infinite families of biregular cages and two new semiregular cages. The constructed new families are $({r,2r-3};5)$-cages for all $r=q+1$ with $q$ a prime power, and $({r,2r-5};5)$-cages for all $r=q+1$ with $q$ a prime. The new semiregular cages are constructed for r=5 and 6 with 31 and 43 vertices respectively.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
