On n-fold L(j,k)-and circular L(j,k)-labelings of graphs

DOI10.1016/J.DAM.2012.06.005zbMATH Open1253.05122OpenAlexW287538350MaRDI QIDQ714037FDOQ714037

Authors: Wensong Lin, Pu Zhang 

Publication date: 19 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.06.005

Recommendations

• \(L(2, 1)\)-labeling of circulant graphs
• On circular-\(L\)(2,1)-edge-labeling of graphs
• On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• \(L(3,1)\)-labeling of circulant graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• \(L(j,k)\)-labelings and \(L(j,k)\)-edge-labelings of graphs.
• On circular-L(2, 1)-labellings of products of graphs
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
• On \(L(d,1)\)-labelings of graphs

zbMATH Keywords

hexagonal lattice\(L(j,k)\)-labeling number\(p\)-dimensional square lattice

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Relating path coverings to vertex labellings with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• A survey on labeling graphs with a condition at distance two
• Degree sequences of matrogenic graphs
• Multiple \(L(j,1)\)-labeling of the triangular lattice
• Graph labeling and radio channel assignment
• Approximations for  -Colorings of Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• On \(L(d,1)\)-labelings of graphs
• Title not available (Why is that?)
• Labeling trees with a condition at distance two.
• A Linear Time Algorithm for L(2,1)-Labeling of Trees
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• Title not available (Why is that?)
• Hamiltonicity and circular distance two labellings
• Cyclic labellings with constraints at two distances
• Labelling graphs with the circular difference
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
• \(L(h,k)\)-labelings of Hamming graphs
• Star matching and distance two labelling
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• Real Number Channel Assignments for Lattices
• \(\lambda\)-coloring matrogenic graphs

Cited In (6)

• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
• \(L(h, k)\)-labelling for octagonal grid
• Multiple \(L(j,1)\)-labeling of the triangular lattice
• n-fold L(2, 1)-labelings of Cartesian product of paths and cycles
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice

This page was built for publication: On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714037)