Mathematics Faculty Publications
 

Source Publication

Discussiones Mathematicae Graph Theory

Document Type

Article

Publication Date

1-1-2019

Volume

39

Issue

1

First Page

143

Last Page

155

DOI

10.7151/dmgt.2086

Abstract

© Faculty of Social Sciences. All right reserved. An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one. Let λ12(Γ) denote the least λ such that Γ admits an L(2, 1)-labeling using labels from {0, 1, . . ., λ}. A Cayley graph of group G is called a circulant graph of order n, if G = Zn. In this paper initially we investigate the upper bound for the span of the L(2, 1)-labeling for Cayley graphs on cyclic groups with “large” connection sets. Then we extend our observation and find the span of L(2, 1)-labeling for any circulants of order n.

Comments

This article was originally published in Discussiones Mathematicae Graph Theory.

Included in

Mathematics Commons

Share

COinS