Related papers: 1-Factorizations of Cayley graphs

A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even…

In 2013, Jemal Abawajy, Andrei Kelarev and Morshed Chowdhury [1] proposed a problem to characterize the finite groups whose power graphs are Cayley graphs of some groups. Here we give a complete answer to this question.

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

Cayley graphs are graphs on algebraic structures, typically groups or group-like structures. In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of cycles, Cayley graphs on some non-abelian groups, and…

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

A 1-factorization $\mathcal{M} = \{M_1,M_2,\ldots,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i, M_j$ with $i \ne j$ is a Hamilton cycle. It is called $k$-semi-perfect if the union of any pair of…

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

A group is said to be capable if it is the central factor of some group. In this paper, among other results we have characterized capable groups of order $p^2q$, for any distinct primes $p, q$, which extends Theorem 1.2 of S. Rashid, N. H.…

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

Let $G$ be a (finite or infinite) group, and let $K_G = \mathrm{Cay} ( G;G \smallsetminus \{1\} )$ be the complete graph with vertex set $G$, considered as a Cayley graph of $G$. Being a Cayley graph, it has a natural edge-colouring by sets…

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

For every prime $p > 3$ and for every prime $q>p^3$ we prove that $\mathbb{Z}_q \times \mathbb{Z}_p^3$ is a DCI-group.

A \emph{mixed dihedral group} is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper we give a sufficient condition…

Given a finite group G, we say that a subset C of G is power-closed if, for every x in C and y in <x> with <x>=<y>, we have that y lies in C. In this paper we are interested in finite Cayley digraphs Cay(G,C) over G with connection set C,…

In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…