Commuting graph of a group action with few edges

Creative Commons License

Güloğlu İ. i. Ş., ERCAN G.

Communications in Algebra, cilt.51, sa.7, ss.2791-2810, 2023 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 51 Sayı: 7
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1080/00927872.2023.2172180
  • Dergi Adı: Communications in Algebra
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, MathSciNet, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.2791-2810
  • Anahtar Kelimeler: Commuting graph, friendship graph, F-graph, group action, FINITE-GROUPS
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

Let A be a group acting by automorphisms on the group G. The commuting graph (Formula presented.) of A-orbits of this action is the simple graph with vertex set (Formula presented.), the set of all A-orbits on (Formula presented.), where two distinct vertices xA and yA are joined by an edge if and only if there exist (Formula presented.) and (Formula presented.) such that (Formula presented.). The present paper characterizes the groups G for which (Formula presented.) is an (Formula presented.) -graph, that is, a connected graph which contains at most one vertex whose degree is not less than three.