Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA note on quadrangular embedding of Abelian Cayley Graphs
234
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of a abelian Cayley graph and construct a family of circulant graphs which reach this bound.
rate research
Read More
In this article we discuss a connection between two famous constructions in mathematics: a Cayley graph of a group and a (rational) billiard surface. For each rational billiard surface, there is a natural way to draw a Cayley graph of a dihedral group on that surface. Both of these objects have the concept of genus attached to them. For the Cayley graph, the genus is defined to be the lowest genus amongst all surfaces that the graph can be drawn on without edge crossings. We prove that the genus of the Cayley graph associated to a billiard surface arising from a triangular billiard table is always zero or one. One reason this is interesting is that there exist triangular billiard surfaces of arbitrarily high genus , so the genus of the associated graph is usually much lower than the genus of the billiard surface.
The result of Boyce and Huneke gives rise to a 1-dimensional continuum, which is the intersection of a descending family of disks, that admits two commuting homeomorphisms without a common fixed point.
Let $X$ be a connected Cayley graph on an abelian group of odd order, such that no two distinct vertices of $X$ have exactly the same neighbours. We show that the direct product $X times K_2$ (also called the canonical double cover of $X$) has only the obvious automorphisms (namely, the ones that come from automorphisms of its factors $X$ and $K_2$). This means that $X$ is stable. The proof is short and elementary. The theory of direct products implies that $K_2$ can be replaced with members of a much more general family of connected graphs.
Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which played an important role in the theory. On the other hand, Polhill (2010) gave a construction of Paley type partial difference sets (conference graphs) based on a special system of building blocks, called a covering extended building set, and proved that there exists a Paley type partial difference set in an abelian group of order $9^iv^4$ for any odd positive integer $v>1$ and any $i=0,1$. His result covers all orders of nonelementary abelian groups in which Paley type partial difference sets exist. In this paper, we give new constructions of strongly regular Cayley graphs on abelian groups by extending the theory of building blocks. The constructions are large generalizations of Polhills construction. In particular, we show that for a positive integer $m$ and elementary abelian groups $G_i$, $i=1,2,ldots,s$, of order $q_i^4$ such that $2m,|,q_i+1$, there exists a decomposition of the complete graph on the abelian group $G=G_1times G_2times cdotstimes G_s$ by strongly regular Cayley graphs with negative Latin square type parameters $(u^2,c(u+1),- u+c^2+3 c,c^2+ c)$, where $u=q_1^2q_2^2cdots q_s^2$ and $c=(u-1)/m$. Such strongly regular decompositions were previously known only when $m=2$ or $G$ is a $p$-group. Moreover, we find one more new infinite family of decompositions of the complete graphs by Latin square type strongly regular Cayley graphs. Thus, we obtain many strongly regular graphs with new parameters.
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of the halved cube graph, the folded cube graph and the Hamming graphs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
