Circular L(j,k)-labeling number of direct product of path and cycle

Qiong Wu, Wai Chee SHIU*, Pak Kiu SUN

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

Abstract

Let j, k and m be positive numbers, a circular m-L(j,k)-labeling of a graph G is a function f:V(G)→[0,m) such that |f(u)-f(v)| m ≥j if u and v are adjacent, and |f(u)-f(v)| m ≥k if u and v are at distance two, where |a-b| m =min{|a-b|,m-|a-b|}. The minimum m such that there exist a circular m-L(j,k)-labeling of G is called the circular L(j,k)-labeling number of G and is denoted by σ j,k (G). In this paper, for any two positive numbers j and k with j≤k, we give some results about the circular L(j,k)-labeling number of direct product of path and cycle.

Original languageEnglish
Pages (from-to)355-368
Number of pages14
JournalJournal of Combinatorial Optimization
Volume27
Issue number2
DOIs
Publication statusPublished - Feb 2014

Scopus Subject Areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Circular L(j,k)-labeling
  • Direct product

Fingerprint

Dive into the research topics of 'Circular L(j,k)-labeling number of direct product of path and cycle'. Together they form a unique fingerprint.

Cite this