T. Tamizh Chelvama - Department of Mathematics, Manonmanian Sundaranar, University Tirunelveli 627 012, Tamil Nadu, India K. Selvakumar - Department of Mathematics, Manonmanian Sundaranar, University Tirunelveli 627 012, Tamil Nadu, India S. Raja - Department of Mathematics, Manonmanian Sundaranar, University Tirunelveli 627 012, Tamil Nadu, India
Let \(\Gamma\) be a non-abelian group and \(\Omega\subseteq \Gamma\). The commuting graph \(C(\Gamma, \Omega)\), has \(\Omega\) as its vertex set with two distinct elements of \(\Omega\) joined by an edge when they commute in \(\Gamma\). In this paper we discuss certain properties of commuting graphs constructured on the dihedral group \(D_{2n}\) with respect to some specific subsets. More specifically we obtain the chromatic number and clique number of these commuting graphs.
T. Tamizh Chelvama, K. Selvakumar, S. Raja, Commuting Graphs on Dihedral Group, Journal of Mathematics and Computer Science, 2 (2011), no. 2, 402--406
Tamizh Chelvama T., Selvakumar K., Raja S., Commuting Graphs on Dihedral Group. J Math Comput SCI-JM. (2011); 2(2):402--406
Tamizh Chelvama, T., Selvakumar, K., Raja, S.. "Commuting Graphs on Dihedral Group." Journal of Mathematics and Computer Science, 2, no. 2 (2011): 402--406
