M. Ebrahimi

activity

20192021

collaborators

Showing math.GRShow all

9 papers · 1 filter

math.GR2021

Regular character-graphs whose eigenvalues are greater than or equal to -2

Mahdi Ebrahimi, Maryam Khatami, Zohreh Mirzaei

Let $G$ be a finite group and $Irr (G)$ be the set of all complex irreducible characters of $G$ . The character-graph $Δ (G)$ associated to $G$ , is a graph whose vertex set i…

math.GR2020

Groups in which the co-degrees of the irreducible characters are distinct

Mahdi Ebrahimi

Let $G$ be a finite group and let $Irr (G)$ be the set of all irreducible complex characters of $G$ . For a character $χ \in Irr (G)$ , the number $\rm{cod}(χ):=|G:\rm{ker}χ|/…

math.GR2020

$K_{4}$ -free character graphs with diameter three

Mahdi Ebrahimi

Let $G$ be a finite group and let $Irr (G)$ be the set of all irreducible complex characters of $G$ . Let $cd (G)$ be the set of all character degrees of $G$ and denote by $…

math.GR2020

Disconnected Character graphs and odd Dominating sets

Mahdi Ebrahimi

Suppose $Γ$ is a finite simple graph. If $D$ is a dominating set of $Γ$ such that each $x \in D$ is contained in the set of vertices of an odd cycle of $Γ$ , then we say that $D$ is…

math.GR2020

$K_{n}$ -free Character Graphs with at Least $2 n$ Vertices

Mahdi Ebrahimi

For a finite group $G$ , let $Δ (G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$ . Akhlaghi and Tong-Viet in \cite{[AT]} conjec…

math.GR2020

n-exact Character Graphs

Mahdi Ebrahimi

Let $Γ$ be a finite simple graph. If for some integer $n ⩾ 4$ , $Γ$ is a $K_{n}$ -free graph whose complement has an odd cycle of length at least $2 n - 5$ , then we say that $Γ$ is…

Regular character-graphs whose eigenvalues are greater than or equal to -2

Groups in which the co-degrees of the irreducible characters are distinct

K4​-free character graphs with diameter three

Disconnected Character graphs and odd Dominating sets

Kn​-free Character Graphs with at Least 2n Vertices

n-exact Character Graphs

$K_{4}$ -free character graphs with diameter three

$K_{n}$ -free Character Graphs with at Least $2 n$ Vertices