M. Ghasemi

most citedA family of tetravalent one-regular graphs

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2021★ 2 cited

A family of tetravalent one-regular graphs

Mohsen Ghasemi, Rezvan Varmazyar

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$ -valent one-regular graphs of order $5 p^{2}$ , where $p$ is a prime, are clas…

math.GR2021

A note on codegrees and Taketa's inequality

Mahtab Delfani, Mohsen Ghasemi, Somayeh Hekmatara

Let $G$ be a finite group and $cd (G)$ will be the set of the degrees of the complex irreducible characters of $G$ . Also let $cod (G)$ be the set of codegrees of the irre…

math.GR2021

Equivalent version of Huppert's conjecture for $K_{3}$ -groups

Mohsen Ghasemi, Somayeh Hekmatara

In this note we verify the equivalent version of Huppert's conjecture for $K_{3}$ -groups.

math.CO2020

Super connectivity of lexicographic product graphs

Khalid Kamyab, Mohsen Ghasemi, Rezvan Varmazyar

For a graph $G$ , $k (G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$ -connectivity of a connected graph is the mi…

math.CO2020

Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree three

Majid Arezoomand, Mohsen Ghasemi

A graph $Γ$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $Γ$ is normal if $G$ …

A family of tetravalent one-regular graphs

A note on codegrees and Taketa's inequality

Equivalent version of Huppert's conjecture for K3​-groups

Super connectivity of lexicographic product graphs

Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree three

Equivalent version of Huppert's conjecture for $K_{3}$ -groups