ARTICLE
TITLE

Some structural graph properties of the non-commuting graph of a class of finite Moufang loops

SUMMARY

For any non-abelian group G, the non-commuting graph of G, G=GG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and only if xy ? yx. This graph is connected for a non-abelian finite group and has received some attention in existing literature. Similarly, the non-commuting graph of a finite Moufang loop has been defined by Ahmadidelir. He has shown that this graph is connected (as for groups) and obtained some results related to the non-commuting graph of a finite non-commutative Moufang loop. In this paper, we show that the multiple complete split-like graphs are perfect (but not chordal) and deduce that the non-commuting graph of Chein loops of the form M(D2n,2) is perfect but not chordal. Then, we show that the non-commuting graph of a non-abelian group G  is split if and only if the non-commuting graph of the Moufang loop M(G,2) is 3-split and then classify all Chein loops that their non-commuting graphs are 3-split. Precisely, we show that for a  non-abelian group G, the non-commuting graph of the Moufang loop M(G,2), is 3-split if and only if G is isomorphic to a Frobenius group of order 2n, n is odd, whose Frobenius kernel is abelian of order n. Finally, we calculate the energy  of  generalized and multiple splite-like graphs, and discuss about the energy and also the number of spanning trees in the case of  the non-commuting graph of  Chein loops of the form M(D2n,2).

 Articles related

I Nengah Suparta    

A Gray code of length n is a list of all binary words of length n such that each two successive codewords differ in only one bit position. If the first and the last codewords also share this property, the Gray code is called cyclic, otherwise it is calle... see more


Somayeh Jahari,Saeid Alikhani    

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x) = ?ni = ?(G)d(G, i)xi, where d(G, i) is the number of dominating sets of G of size i and ?(G) is the domination number of G. A root of D(G, x) is called a domina... see more


Mahsa Mozafari-Nia,Moharram N. Iradmusa    

A vi-simultaneous proper k-coloring of a graph G is a coloring of all vertices and incidences of the graph in which any two adjacent or incident elements in the set V(G)?I(G) receive distinct colors, where I(G) is ... see more


Mostafa Tavakoli,Meysam Korivand,Ahmad Erfanian,Gholamreza Abrishami,Edy Tri Baskoro    

For an ordered subset S = {v1, …, vk} of vertices in a connected graph G and an edge e' of G, the edge metric S-representation of e'=ab is the vector rGe(e'|S)=(dG(e',v1),…,dG(e',vk)) , where dG... see more


Cristina Dalfo,Miquel Àngel Fiol    

A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed g... see more