LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On groups covered by finitely many centralizers and domination number of the commuting graphs

Photo by vika_strawberrika from unsplash

Abstract For a finite nonabelian group G, let be the smallest integer m such that G contains m proper centralizers with property In this article, we find for some groups… Click to show full abstract

Abstract For a finite nonabelian group G, let be the smallest integer m such that G contains m proper centralizers with property In this article, we find for some groups of interest. For two isoclinic groups G1 and G2, we prove that Also we give an upper bound for and determine groups for which this bound is sharp. We investigate groups G for which where is the minimum size of a maximal subset of pairwise non-commuting elements of a group G.

Keywords: domination number; finitely many; groups covered; many centralizers; centralizers domination; covered finitely

Journal Title: Communications in Algebra
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.