Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
From MaRDI portal
Publication:4540142
DOI10.1109/81.917988zbMath0997.94044OpenAlexW2169957156MaRDI QIDQ4540142
Publication date: 21 July 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.917988
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(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 ⋮ Distance two labelling and direct products of graphs ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ \(L(2,1)\)-labeling of direct product of paths and 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 ⋮ \(L(2,1)\)-labeling for brick product graphs ⋮ \(L(2,1)\)-labeling of strong products of cycles ⋮ Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
