Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
An \(L(d,1)\)-labeling of the vertex set \(V_G\) of a graph \(G\) is an assignment of nonnegative integers to the vertices so that the labels of every pair of adjacent vertices differ at least in \(d\) and those at distance 2 receive different labels. Let \(\lambda^d_1(G)\) denote the minimal \(\lambda\) for which there exists an \(L(d,1)\)-labeling that uses labels from the set \(\{0,1,\dots,\lambda\}\). It is shown that for \(d\geq 1\) and \(k\geq 2\), for the Cartesian product of cycles one has \(\lambda^d_1(C_{m_0}\times\cdots\times C_{m_{k-1}})\leq 2^k + 2d-2\) with equality if \(1\leq d\leq 2^k\). Similarly, for the direct product of cycles one has \(\lambda^d_1(C_{m_0}\otimes\cdots \otimes C_{m_{k-1}})\leq 2k+2d-2\) with equality if \(1\leq d\leq 2k\).
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- On L(d,1)-labelings of the Cartesian product of two cycles.
- 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
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- scientific article; zbMATH DE number 1792593
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
- \(T\)-colorings of graphs: recent results and open problems
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 1409224 (Why is no real title available?)
- Labeling products of complete graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- On L(2,1)-labelings of Cartesian products of paths and cycles
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- Relating path coverings to vertex labellings with a condition at distance two
- Smallest independent dominating sets in Kronecker products of cycles
- On the \(L(2,1)\)-labelings of amalgamations of graphs
- Lambda number for the direct product of some family of graphs
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- 2-distance colorings of some direct products of paths and cycles
- Radio number for the product of a path and a complete graph
- 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(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- \(L(h, k)\)-labelling for octagonal grid
- On L(d,1)-labelings of the Cartesian product of two cycles.
- L(2, 1)-labellings for direct products of a triangle and a cycle
- Distance three labellings for \(K _n\times K_2\)
- L(d,1)-labelings of the edge-path-replacement of a graph
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
- (d,1)-total labeling of lexicographic products of some classes of graphs
- L(2,1)-labelings of the edge-multiplicity-paths-replacement of a graph
- scientific article; zbMATH DE number 7688018 (Why is no real title available?)
- Coloring the square of the Cartesian product of two cycles
- Connectivity of Cartesian products of graphs
This page was built for publication: Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576352)
