On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037): Difference between revisions

Let \(n,j,k\) be positive integers. An \(n\)-fold \(L(j,k)\)-labeling of a graph \(G\) is an assignment \(f\)of sets of nonnegative integers of order \(n\) to the vertices of \(G\) such that for any two vertices \(u,v\) and any two integers \(a\in f(u)\), \(b\in f(v)\), \(|a-b| \geq j\) if \(uv\in E(G)\), and \(|a-b|\geq k\) if \(u\) and \(v\) are distance \(2\) apart. The span of \(f\) is the absolute difference between the maximum and minimum integers used by \(f\). The \(n\)-fold \(L(j,k)\)-labeling number of \(G\) is the minimum span over all \(n\)-fold \(L(j,k)\)-labeling of \(G\). Let \(n,j,k\) and \(m\) be positive integers. An \(n\)-fold circular \(m\)-\(L(j,k)\)-labeling of a graph \(G\) is an assignment of subsets of \((0,1,\dots,m-1)\) of order \(n\) to the vertices of \(G\) such that for any two vertices \(u,v\) and any two integers \(a\in f(u)\), \(b\in f(v)\), \(\min\{|a-b|,\,m-|a-b|\}\geq j\) if \(uv\in E(G)\), and \(\min\{|a-b|,\,m-|a-b|\}\geq k\) if \(u\) and \(v\) are distance \(2\) apart. The minimum \(m\) such that \(G\) has an \(n\)-fold circular \(m\)-\(L(j,k)\)-labeling is called the \(n\)-fold circular \(L(j,k)\)-labeling number of \(G\). The basic properties of \(n\)-fold \(L(j,k)\)-labeling and circular \(L(j,k)\)-labeling of graphs are investigate. In particular, the \(n\)-fold circular \(L(j,k)\)-labeling numbers of trees and the hexagonal and \(p\)-dimensional square lattice are determined. Besides, the upper and lower bounds for the \(n\)-fold \(L(j,k)\)-labeling numbers of trees are obtained.