A note on the distance spectra of co-centralizer graphs

preprint2022arXivOpen access

Abstract

Let GG be a finite non abelian group. The centralizer graph of GG is a simple undirected graph Γcent(G)Γ_{cent}(G), whose vertex set consists of proper centralizers of GG and two vertices are adjacent if and only if their cardinalities are identical [6]. We call the complement of the centralizer graph as the co-centralizer graph. In this paper, we investigate the distance, distance (signless) Laplacian spectra of co-centralizer graphs of some classes of finite non-abelian groups, and obtain some conditions on a group so that the co-centralizer graph is distance, distance (signless) Laplacian integral.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.