The Szeged Index of Power Graph of Finite Groups

Abstract

The Szeged index of a graph is an invariant with several applications in chemistry. The power graph of a finite group G is a graph having vertex set as G in which two vertices u and v are adjacent if v=um or u=vn for some m,n∈ N. In this paper, we first obtain a formula for the Szeged index of the generalized join of graphs. As an application, we obtain the Szeged index of the power graph of the finite cyclic group Zn for any n>2. We further obtain a relation between the Szeged index of the power graph of Zn and the Szeged index of the power graph of the dihedral group Dn. We also provide SAGE codes for evaluating the Szeged index of the power graph of Zn and Dn at the end of this paper.

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…