We say that two graphs G1 and G2 with the same vertex set commute if their adjacency matrices commute. In this paper, we find all integers n such that the complete bipartite graph Kn, n is decomposable into commuting perfect matchings or commuting Hamilton cycles. We show that there are at most n−1 linearly independent commuting adjacency matrices of size n; and if this bound occurs, then there...

‎Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$‎. ‎In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$‎, ‎where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$‎. ‎We introduce a new graph determined ...

‎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...