Mohsen Ghasemi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Mohsen Ghasemi has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
Mehdi Ghaffarzadeh
Department of Mathematics, Khoy Branch, Islamic Azad University, Khoy, Iran
4 shared publications- Rezvan Varmazyar
Department of Mathematics, Khoy Branch, Islamic Azad University, Khoy, Iran
3 shared publications Somayeh Hekmatara
Department of Mathematics, Urmia University, Urmia, Iran
3 shared publications- Ali Asghar Talebi
Tarbiat Modares University
2 shared publications - Doost Ali Mojdeh
Department of Mathematics, Faculty of Mathematical Sciences, University of Mazandaran, Babolsar, Iran
2 shared publications Ferydoun Alizadeh
Department of Mathematics, Urmia University, Urmia, Iran
2 shared publications
Latest Publications
- Open Access
- 28 October 2025
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 13 (2) , 373-381
Minimally 4-restricted edge connected graphs
Minimally 4-restricted edge connected graphs
- 28 October 2025
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 13 (2) , 373-381
Open AccessMinimally 4-restricted edge connected graphs
Minimally 4-restricted edge connected graphs
- Open Access
Total perfect codes in Cayley sum graphs of cyclic groups
We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the connection set of the graph including when it is periodic, aperiodic, or square-free. To this end, we utilize a correspondence that we first establish between total perfect codes and factorizations of groups, along with their algebraic properties. We then generalize some of these conditions to the direct product of cyclic groups, i.e. $\mathbb{Z}_{n_1} \times \dots \times \mathbb{Z}_{n_d}$.Open AccessTotal perfect codes in Cayley sum graphs of cyclic groups
We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the connection set of the graph including when it is periodic, aperiodic, or square-free. To this end, we utilize a correspondence that we first establish between total perfect codes and factorizations of groups, along with their algebraic properties. We then generalize some of these conditions to the direct product of cyclic groups, i.e. $\mathbb{Z}_{n_1} \times \dots \times \mathbb{Z}_{n_d}$. - Open Access
Finite groups of non-prime-power order with exactly four character codegrees
For an irreducible complex character \(χ\) of a finite group \(G\), the \emph{codegree} of \(χ\) is defined as the ratio \(|G : \ker(χ)| / χ(1)\), where \(\ker(χ)\) represents the kernel of \(χ\). In this paper, we provide a detailed characterization of finite groups of non-prime power order that have exactly four irreducible character co-degrees.Open AccessFinite groups of non-prime-power order with exactly four character codegrees
For an irreducible complex character \(χ\) of a finite group \(G\), the \emph{codegree} of \(χ\) is defined as the ratio \(|G : \ker(χ)| / χ(1)\), where \(\ker(χ)\) represents the kernel of \(χ\). In this paper, we provide a detailed characterization of finite groups of non-prime power order that have exactly four irreducible character co-degrees. - Open Access
Some results on perfect codes in Cayley sum graphs
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
Open AccessSome results on perfect codes in Cayley sum graphs
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
- 20 February 2025
- Published by Springer Nature in Ricerche di Matematica
- p. 1-7
The average degree of some rational irreducible characters
- 20 February 2025
- Published by Springer Nature in Ricerche di Matematica
- p. 1-7
The average degree of some rational irreducible characters
- 11 October 2024
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (06)
Tetravalent s-transitive graphs of order 6p2
Let [ ] be a positive integer. A graph is [ ]-transitive if its automorphism group is transitive on s-arcs but not on [ ]-arcs. In this paper, we study all tetravalent [ ]-transitive graphs of order [ ].
- 11 October 2024
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (06)
Tetravalent s-transitive graphs of order 6p2
Let [ ] be a positive integer. A graph is [ ]-transitive if its automorphism group is transitive on s-arcs but not on [ ]-arcs. In this paper, we study all tetravalent [ ]-transitive graphs of order [ ].
- Open Access
- 9 June 2023
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 20 (3) , 1-3
Under which conditions is λ″(G)=κ″(L(G))?
- 9 June 2023
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 20 (3) , 1-3
Open AccessUnder which conditions is λ″(G)=κ″(L(G))?
- 31 January 2023
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 46 (9) , 1863-1870
Equivalent version of Huppert’s conjecture for codegrees of K3-groups
For a character χ of a finite group G the number cod(χ) = |G : Ker(χ)|/χ(1) is called the codegree of χ. In this note, we verify the equivalent version of Huppert's conjecture for K3-groups.
- 31 January 2023
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 46 (9) , 1863-1870
Equivalent version of Huppert’s conjecture for codegrees of K3-groups
For a character χ of a finite group G the number cod(χ) = |G : Ker(χ)|/χ(1) is called the codegree of χ. In this note, we verify the equivalent version of Huppert's conjecture for K3-groups.
- 27 November 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (7) , 7272-7285
The g-good-neighbor diagnosability of triangle-free graphs
- 27 November 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (7) , 7272-7285
The g-good-neighbor diagnosability of triangle-free graphs
- 25 August 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (12) , 5479-5480
Corrigendum to: Groups with few codegrees of irreducible characters
In this corrigendum, we correct the proof of Theorem 3.5, which states that if is a Frobenius group with , then is an elementary abelian group.- 25 August 2022
- Published by Taylor & Francis in Communications in Algebra
- Vol. 50 (12) , 5479-5480
Corrigendum to: Groups with few codegrees of irreducible characters
In this corrigendum, we correct the proof of Theorem 3.5, which states that if is a Frobenius group with , then is an elementary abelian group.