Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination

DOI10.1109/81.886984zbMath0997.94045OpenAlexW2146516968MaRDI QIDQ2724308

Pranava K. Jha

Publication date: 13 November 2002

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/81.886984

zbMATH Keywords

cycleindependent dominating setCartesian product of graphsassigning frequenciesleast span of frequencies

Mathematics Subject Classification ID

Paths and cycles (05C38) Technical applications of optics and electromagnetic theory (78A55) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory to circuits and networks (94C15)

Related Items

The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ \(L(p,q)\) labeling of \(d\)-dimensional 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(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(2,1)\)-labelling of generalized prisms ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ Distance two labelling and direct products of graphs ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ Coloring the square of the Cartesian product of two cycles ⋮ A survey on labeling graphs with a condition at distance two ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Distance-two labelings of graphs