1. CMB 2016 (vol 60 pp. 12)
 Akbari, Saieed; Miraftab, Babak; Nikandish, Reza

Comaximal Graphs of Subgroups of Groups
Let $H$ be a group. The comaximal graph of subgroups
of $H$, denoted by $\Gamma(H)$, is a
graph whose vertices are nontrivial and proper subgroups of
$H$ and two distinct vertices $L$
and $K$ are adjacent in $\Gamma(H)$ if and only if $H=LK$. In
this paper, we study the connectivity, diameter, clique number
and vertex
chromatic number of $\Gamma(H)$. For instance, we show that
if $\Gamma(H)$ has no isolated vertex, then $\Gamma(H)$
is connected with diameter at most $3$. Also, we characterize
all finite groups whose comaximal graphs are connected.
Among other results, we show that if $H$ is a finitely generated
solvable group and $\Gamma(H)$ is connected and moreover the
degree of a maximal subgroup is finite, then $H$ is finite.
Furthermore, we show that the degree of each vertex in the
comaximal graph of a general linear group over an algebraically
closed field is zero or infinite.
Keywords:comaximal graphs of subgroups of groups, diameter, nilpotent group, solvable group Categories:05C25, 05E15, 20D10, 20D15 

2. CMB 2016 (vol 59 pp. 652)
 Su, Huadong

On the Diameter of Unitary Cayley Graphs of Rings
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.
Keywords:unitary Cayley graph, diameter, $k$good, unit sum number, selfinjective ring Categories:05C25, 16U60, 05C12 

3. CMB 2014 (vol 58 pp. 105)
 HosseinZadeh, Samaneh; Iranmanesh, Ali; Hosseinzadeh, Mohammad Ali; Lewis, Mark L.

On Graphs Associated with Character Degrees and Conjugacy Class Sizes of Direct Products of Finite Groups
The prime vertex graph, $\Delta (X)$, and the common divisor graph,
$\Gamma (X)$, are two graphs that have been defined on a set of
positive integers $X$.
Some
properties of these graphs have been studied in the cases where either
$X$ is the set of character degrees of a group or $X$ is the set of
conjugacy class sizes of a group. In this paper, we gather some
results on these graphs arising in the context of direct product of
two groups.
Keywords:prime vertex graph, common divisor graph, character degree, class sizes, graph operation Categories:20E45, 05C25, 05C76 

4. CMB 2013 (vol 57 pp. 188)