\(L(j,k)\)-labeling numbers of square of paths
From MaRDI portal
Publication:1680886
DOI10.1016/j.akcej.2017.07.001zbMath1375.05244MaRDI QIDQ1680886
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
05C38: Paths and cycles
05C12: Distance in graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
L(1, 2)-labeling numbers on square of cycles, Exact square coloring of graphs resulting from some graph operations and products
Cites Work
- \(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
- Unnamed Item
- Unnamed Item