2 citations · 2 across the 7 of their papers we have counts for
7 papers
Tetravalent half-arc-transitive graphs of order
M. Ghasemi, A. A. Talebi, N. Mehdipoor
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not its arc set. In this paper, we study all tetravalent half-arc-transi…
Tetravalent vertex-transitive graphs of order
Majid Arezoomand, Mohsen Ghasemi, Mohammad A. Iranmanesh
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a…
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, -valent one-regular graphs of order , where is a prime, are clas…
A note on codegrees and Taketa's inequality
Mahtab Delfani, Mohsen Ghasemi, Somayeh Hekmatara
Let be a finite group and will be the set of the degrees of the complex irreducible characters of . Also let be the set of codegrees of the irre…
Equivalent version of Huppert's conjecture for -groups
Mohsen Ghasemi, Somayeh Hekmatara
In this note we verify the equivalent version of Huppert's conjecture for -groups.
Super connectivity of lexicographic product graphs
Khalid Kamyab, Mohsen Ghasemi, Rezvan Varmazyar
For a graph , denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also -connectivity of a connected graph is the mi…
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 if it admits as a semiregular automorphism group with two orbits of equal size. We say that is normal if …