Super commuting graphs of finite groups and their Zagreb indices

Abstract

Let B be an equivalence relation defined on a finite group G. The B super commuting graph on G is a graph whose vertex set is G and two distinct vertices g and h are adjacent if either [g] = [h] or there exist g' ∈ [g] and h' ∈ [h] such that g' commutes with h', where [g] is the B-equivalence class of g ∈ G. Considering B as the equality, conjugacy and same order relations on G, in this article, we discuss the graph structures of equality/conjugacy/order super commuting graphs of certain well-known families of non-abelian groups viz. dihedral groups, dicyclic groups, semidihedral groups, quasidihedral groups, the groups U6n, V8n, M2mn etc. Further, we compute the Zagreb indices of these graphs and show that they satisfy Hansen-Vukicevi\'c conjecture.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…