Lambda Numbers of Finite p-Groups

Abstract: An

L (2, 1)

-labelling of a finite graph

G a m m a

is a function that assigns integer values to the vertices

V (G a m m a)

of

G a m m a

(colouring of

V (G a m m a)

by

m a t h b b Z

) so that the absolute difference of two such values is at least

2

for adjacent vertices and is at least

1

for vertices which are precisely distance

2

apart. The lambda number

l a m b d a (G a m m a)

of

G a m m a

measures the least number of integers needed for such a labelling (colouring). A power graph

G a m m a_{G}

of a finite group

G

is a graph with vertex set as the elements of

G

and two vertices are joined by an edge if and only if one of them is a positive integer power of the other. It is known that

l a m b d a (G a m m a_{G}) g e q | G |

for any finite group. In this paper we show that if

G

is a finite group of a prime power order, then

l a m b d a (G a m m a_{G}) = | G |

if and only if

G

is neither cyclic nor a generalized quaternion

2

-group. This settles a partial classification of finite groups achieving the lower bound of lambda number.

This page was built for publication: Lambda Numbers of Finite $p$-Groups