Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles

DOI10.1016/j.dam.2005.04.007zbMath1084.05060OpenAlexW2112294028MaRDI QIDQ2576352

Aleksander Vesel, Sandi Klavžar, Pranava K. Jha

Publication date: 27 December 2005

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

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

zbMATH Keywords

Cartesian product of graphs1)\)-labeling\(L(d

Mathematics Subject Classification ID

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

Related Items (19)

The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ Lambda number for the direct product of some family of graphs ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ Coloring the square of the Cartesian product of two cycles ⋮ Connectivity of Cartesian products of graphs ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths ⋮ L(h,k)-labelling for octagonal grid ⋮ L(2, 1)-labellings for direct products of a triangle and a cycle ⋮ Distance three labellings for K _n ×K ₂ ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE ⋮ 2-distance colorings of some direct products of paths and cycles ⋮ Radio number for the product of a path and a complete graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(T\)-colorings of graphs: recent results and open problems
• Relating path coverings to vertex labellings with a condition at distance two
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Smallest independent dominating sets in Kronecker products of cycles

This page was built for publication: Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles