Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T01:41:27.348Z Has data issue: false hasContentIssue false

ON THE SYMMETRIC NORMALISER GRAPH OF A GROUP

Published online by Cambridge University Press:  24 June 2026

SURBHI TANWAR*
Affiliation:
School of Liberal Studies (Mathematics), Dr. B. R. Ambedkar University Delhi , Delhi 110006, India
GEETHA VENKATARAMAN
Affiliation:
School of Liberal Studies (Mathematics), Dr. B. R. Ambedkar University Delhi , Delhi 110006, India e-mail: geetha@aud.ac.in
Rights & Permissions [Opens in a new window]

Abstract

In this paper, we introduce the symmetric normaliser graph of a group G. The vertex set of this graph consists of the elements of the group. Vertices x and y are adjacent if x lies in the normaliser of $\langle y \rangle $ and y lies in the normaliser of $\langle x \rangle $. We investigate the position this graph occupies in the hierarchy of graphs defined on groups. We show that the existing hierarchy is further refined by this graph and that the edges of this graph lie between the edges of the commuting graph and the nilpotent graph. For finite groups, we prove a necessary and sufficient condition for the symmetric normaliser graph to be equal to the commuting graph, and similarly, for equality with the nilpotent graph. The edge set of the symmetric normaliser graph is also a subset of the edge set of the Engel graph of a group and has connections to the nongenerating graph of a group.

Information

Type
Research Article
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.