Abstract
Let Γ be a non-abelian group and Ω ⊆ Γ. The commuting graph C(Γ, Ω), has Ω as its vertex set with two distinct elements of Ω joined by an edge when they commute in Γ. In this paper we discuss certain properties of commuting graphs constructured on the dihedral group D2n with respect to some specific subsets. More specifically we obtain the chromatic number and clique number of these commuting graphs. 20
Cite
CITATION STYLE
APA
Tamizh Chelvama, T., Selvakumar, K., & Raja, S. (2011). Commuting Graphs On Dihedral Group. Journal of Mathematics and Computer Science, 02(02), 402–406. https://doi.org/10.22436/jmcs.002.02.20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free