[PDF][PDF] Commuting graphs on dihedral group
TT Chelvam, K Selvakumar, S Raja - Turk. J. Math. Comput. Sci, 2011 - researchgate.net
TT Chelvam, K Selvakumar, S Raja
Turk. J. Math. Comput. Sci, 2011•researchgate.netLet Γ 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.
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.
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.
researchgate.net
以上显示的是最相近的搜索结果。 查看全部搜索结果