Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

Let j, k and σ be positive numbers, a circular σ-L(j, k)-labeling of a graph G is a function f : V (G) → [0, σ) such that |f(u) - f(v)|σ ≥ j if u and v are adjacent, and |f(u) - f(v)|σ ≥ k if u and v are at distance two, where |a - b|σ = min{|a - b|, σ - |a - b|}. The minimum σ such that there exist a circular σ-L(j, k)-labeling of G is called the circular-L(j, k)-labeling number of G and is denoted by σj,k(G). The k-th power Gk of an undirected graph G is a graph with the same set of vertices and an edge between two vertices when their distance in G is at most k. In this paper, the circular L(j, k)-labeling numbers of P2n are determined.

Keywords

Circular L(j, k)-labeling, square of path, code assignment

Publication Date

2017

Source Publication Title

Journal of Combinatorics and Number Theory

Volume

9

Issue

1

Start Page

41

End Page

46

Publisher

Nova Science Publishers

Peer Reviewed

1

Copyright

Nova Science Publishers

Funder

This work is supported by Tianjin Research Program of Application Foundation and Advanced Technology, Tianjin Municipal Science and Technology Commission (No. 14JCYBJC43100), National Natural Science Foundation of China (No. 11601391), Faculty Research Grant of Hong Kong Baptist University.

ISSN (electronic)

19425600

Included in

Mathematics Commons

Share

COinS