\(L(2,1)\)-labeling of direct product of paths and cycles

DOI10.1016/j.dam.2004.01.019zbMath1066.05129OpenAlexW2138402843MaRDI QIDQ1764815

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

Publication date: 22 February 2005

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

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

zbMATH Keywords

\(\lambda\)-numberChannel assignmentDirect product of graphsDynamic algorithmFasciagraphRotagraphVertex labeling

Mathematics Subject Classification ID

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

Related Items (17)

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ \(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 ⋮ Generic algorithms for some decision problems on fasciagraphs and rotagraphs ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ Lambda number for the direct product of some family of graphs ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ L(h,k)-labelling for octagonal grid ⋮ L(2, 1)-labellings for direct products of a triangle and a cycle ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ On circular-L(2, 1)-labellings of products of graphs ⋮ 2-distance colorings of some direct products of paths and cycles

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matching polynomial of a polygraph
• A randomised 3-colouring algorithm
• \(T\)-colorings of graphs: recent results and open problems
• Relating path coverings to vertex labellings with a condition at distance two
• Distance-related invariants on polygraphs
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Improved lower bound on the Shannon capacity of \(C_7\)
• Algebraic approach to fasciagraphs and rotagraphs
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• Diagonal and toroidal mesh networks
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Fixed-parameter complexity of \(\lambda\)-labelings
• Smallest independent dominating sets in Kronecker products of cycles

This page was built for publication: \(L(2,1)\)-labeling of direct product of paths and cycles