Journal of Applied Mathematics and Physics

Volume 11, Issue 5 (May 2023)

ISSN Print: 2327-4352   ISSN Online: 2327-4379

Google-based Impact Factor: 0.70  Citations  

L(h, k)-Labeling of Circulant Graphs

HTML  XML Download Download as PDF (Size: 560KB)  PP. 1448-1458  
DOI: 10.4236/jamp.2023.115094    57 Downloads   218 Views  

ABSTRACT

An L(h,k)-labeling of a graph G is an assignment of non-negative integers to the vertices such that if two vertices u and v are adjacent then they receive labels that differ by at least h, and when u and v are not adjacent but there is a two-hop path between them, then they receive labels that differ by at least k. The span λ of such a labeling is the difference between the largest and the smallest vertex labels assigned. Let λhk  ( )denote the least λ such that G admits an L(h,k) -labeling using labels from {0,1,...λ}. A Cayley graph of group is called circulant graph of order n, if the group is isomorphic to Zn. In this paper, initially we investigate the L(h,k) -labeling for circulant graphs with “large” connection sets, and then we extend our observation and find the span of L(h,k) -labeling for any circulants of order n.

Share and Cite:

Mitra, S. and Bhoumik, S. (2023) L(h, k)-Labeling of Circulant Graphs. Journal of Applied Mathematics and Physics, 11, 1448-1458. doi: 10.4236/jamp.2023.115094.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.