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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda\)-coloring matrogenic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(d,1)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling trees with a condition at distance two. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent progress in mathematics and engineering on optimal graph labellings with distance conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Number Channel Assignments for Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for L(2,1)-Labeling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(h,k)\)-labelings of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic labellings with constraints at two distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star matching and distance two labelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and circular distance two labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3572431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequences of matrogenic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling graphs with the circular difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple \(L(j,1)\)-labeling of the triangular lattice / rank
 
Normal rank

Revision as of 18:43, 5 July 2024

scientific article
Language Label Description Also known as
English
On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
scientific article

    Statements

    On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (English)
    0 references
    0 references
    0 references
    19 October 2012
    0 references
    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.
    0 references
    \(L(j,k)\)-labeling number
    0 references
    hexagonal lattice
    0 references
    \(p\)-dimensional square lattice
    0 references

    Identifiers