Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
DOI10.1109/81.886984zbMath0997.94045OpenAlexW2146516968MaRDI QIDQ2724308
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
cycleindependent dominating setCartesian product of graphsassigning frequenciesleast span of frequencies
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 (18)
This page was built for publication: Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination