The Lambda Number of the Power Graph of Finite Simple Groups

MaRDI QIDQ6391632zbMATH OpenFDO

Authors Siddhartha Sarkar

Publication date 20 February 2022

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Finite simple groups and their classification (20D05)

Abstract: For a finite group $G$, the power graph $Gamm{a}_G$ is a graph whose set of vertices is equal to $G$ and two distinct elements of $G$ are adjacent if and only if one of them is a positive integer power of the other. An $L(2,1)$-labelling of $Gamm{a}_G$ is an integer-valued function defined on $G$ so that the distance between the images of two adjacent vertices (resp. vertices with distance two) are at least two (resp. at least one). The lambda number $lambda(G)$ is defined to be the least difference between the largest and the smallest integer values assigned to the vertices of $Gamm{a}_G$ for all possible $L(2,1)$-labellings of $Gamm{a}_G$. It is known that $lambda(G)geq|G|$. In this paper, we prove that if $G$ is a finite simple group, then $lambda(G)=|G|$ except when $G$ is cyclic of prime order. This settles a partial classification of finite groups $G$ that achieve the lower bound on of lambda number.

This page was built for publication: The Lambda Number of the Power Graph of Finite Simple Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6391632)