%0 Journal Article
%T The order difference interval graph of a group
%A P. Balakrishnan
%A R. Kala
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X In this paper we introduce the concept of order difference interval graph  ODI (G) of a group G. It is a graph  ODI (G) with V ( ODI (G)) = G and two vertices a and b are adjacent in  ODI (G) if and only if o(b)   o(a) ¡Ê [o(a), o(b)]. Without loss of generality, we assume that o(a) ¡Ü o(b). In this paper we obtain several properties of  ODI (G), upper bounds on the number of edges of  ODI (G) and determine those groups whose order difference interval graph is isomorphic to a complete multipartite graph.
%K Order difference interval graph
%K Unicyclic graph
%K Eulerian
%K generating set
%U http://www.combinatorics.ir/?_action=showPDF&article=1588&_ob=9fb8176991b10ac13f1c1c7d632dd893&fileName=full_text.pdf