A. Erfanian

Department of Pure Mathematics‎, ‎Ferdowsi University of Mashhad‎, ‎Mashhad‎, ‎Iran.

[ 1 ] - $n$-Array Jacobson graphs

We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.

[ 2 ] - On cycles in intersection graphs of rings

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

[ 3 ] - Relative n-th non-commuting graphs of finite groups

‎Suppose $n$ is a fixed positive integer‎. ‎We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$‎, ‎associated to the non-abelian subgroup $H$ of group $G$‎. ‎The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G‎ : ‎[x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$‎. ‎Moreover‎, ‎${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...

[ 4 ] - Finite groups with three relative commutativity degrees

‎‎For a finite group $G$ and a subgroup $H$ of $G$‎, ‎the relative commutativity degree of $H$ in $G$‎, ‎denoted by $d(H,G)$‎, ‎is the probability that an element of $H$ commutes with an element of $G$‎. ‎Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$‎. ‎It is shown that a finite group $G$ admits three relative commutativity degrees if a...

[ 5 ] - THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G

To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...