LIPSCHITZ LABELING OF SOME STAR GRAPHS
Abstract
Lipschitz labelling on graph is a function from the vertex set and edge set of the graph to where and such that
- is bijective.
- for all
- for all
- There exists a positive integer such that
for all and for .
We study the problem of Lipschitz labelling within the context of structured graphs. Specifically, we establish the Lipschitz constants for three families of star-derived graphs: twinkling star graphs with ray of length , triangular graphs and bistar graphs .

