\(L(j,k)\)-labeling numbers of square of paths

DOI10.1016/J.AKCEJ.2017.07.001zbMath1375.05244OpenAlexW2749642226MaRDI QIDQ1680886

Wai Chee Shiu, Qiong Wu

Publication date: 17 November 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.07.001

zbMATH Keywords

path\(L(j,k)\)-labelingcode assignmentsquare of path

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Exact square coloring of graphs resulting from some graph operations and products ⋮ L(1, 2)-labeling numbers on square of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(j, k)\)-number of direct product of path and cycle
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• A survey on labeling graphs with a condition at distance two
• Graph distance‐dependent labeling related to code assignment in computer networks
• Labeling trees with a condition at distance two
• \(L(j,k)\)-labeling number of Cartesian product of path and cycle

This page was built for publication: \(L(j,k)\)-labeling numbers of square of paths