Abstract view
On the Diameter of Unitary Cayley Graphs of Rings


Published:20160607
Printed: Sep 2016
Huadong Su,
School of Mathematical and Statistics Sciences, Guangxi Teachers Education University, Nanning, Guangxi, 530023, P. R. China
Abstract
The unitary Cayley graph of a ring $R$, denoted
$\Gamma(R)$, is the simple graph
defined on all elements of $R$, and where two vertices $x$ and
$y$
are adjacent if and only if $xy$ is a unit in $R$. The largest
distance between all pairs of vertices of a graph $G$ is called
the
diameter of $G$, and is denoted by ${\rm diam}(G)$. It is proved
that for each integer $n\geq1$, there exists a ring $R$ such
that
${\rm diam}(\Gamma(R))=n$. We also show that ${\rm
diam}(\Gamma(R))\in \{1,2,3,\infty\}$ for a ring $R$ with $R/J(R)$
selfinjective and classify all those rings with ${\rm
diam}(\Gamma(R))=1$, 2, 3 and $\infty$, respectively.
MSC Classifications: 
05C25, 16U60, 05C12 show english descriptions
Graphs and abstract algebra (groups, rings, fields, etc.) [See also 20F65] Units, groups of units Distance in graphs
05C25  Graphs and abstract algebra (groups, rings, fields, etc.) [See also 20F65] 16U60  Units, groups of units 05C12  Distance in graphs
