Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
From MaRDI portal
Publication:2724308
DOI10.1109/81.886984zbMath0997.94045MaRDI 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
cycle; independent dominating set; Cartesian product of graphs; assigning frequencies; least span of frequencies
05C38: Paths and cycles
78A55: Technical applications of optics and electromagnetic theory
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
94C15: Applications of graph theory to circuits and networks
Related Items
\(L(d,1)\)-labelings of the edge-path-replacement of a graph, \(L(2,1)\)-labelling of generalized prisms, Coloring the square of the Cartesian product of two cycles, Distance two labelling and direct products of graphs, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers, \(L(2,1)\)-labeling of direct product of paths and cycles, On \(L(2,1)\)-labelings of Cartesian products of paths and cycles, Distance-two labelings of graphs, On the \(L(2,1)\)-labelings of amalgamations of graphs, 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 (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs, \(L(2,1)\)-labelings of Cartesian products of two cycles, A survey on labeling graphs with a condition at distance two
