Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
DOI10.1109/81.917988zbMATH Open0997.94044OpenAlexW2169957156MaRDI QIDQ4540142FDOQ4540142
Authors: Pranava K. Jha 
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
Recommendations
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
- On \(L(2,1)\)-labelings of some products of oriented cycles
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- On \(L(d,1)\)-labelings of the Cartesian product of two cycles.
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- scientific article; zbMATH DE number 1792593
- \(L(2,1)\)-labeling of direct product of paths and cycles
Technical applications of optics and electromagnetic theory (78A55) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory to circuits and networks (94C15)
Cited In (19)
- \(L(2,1)\)-labelling of generalized prisms
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- Distance constrained labelings of strong product of \(n\) general graphs.
- On \(L(2,1)\)-labelings of some products of oriented cycles
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
- \(L(2,1)\)-labeling of direct product of paths and cycles
- \(L(2,1)\)-labeling for brick product graphs
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- \(L(2,1)\)-labeling of strong products of cycles
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
- \(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
- \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
- \(L(j, k)\)-number of direct product of path and cycle
- Distance two labelling and direct products of graphs
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph
This page was built for publication: Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540142)
