On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
From MaRDI portal
Publication:1005229
DOI10.1016/j.dam.2007.11.019zbMath1169.05376OpenAlexW2063202459MaRDI QIDQ1005229
Publication date: 9 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.11.019
Related Items
Total edge irregularity strength of generalized prism ⋮ Total vertex irregularity strength of generalized prism graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ Unnamed Item ⋮ \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ Some algebraic polynomials and topological indices of generalized prism and toroidal polyhex networks ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ Coloring the square of Sierpiński graphs ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ Coloring the square of the Cartesian product of two cycles ⋮ L(1,1)-Labeling of direct product of cycles ⋮ 2-Distance chromatic number of some graph products ⋮ 2-distance colorings of some direct products of paths and cycles ⋮ On d-distance equitable chromatic number of some graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance-two labelings of digraphs
- Relating path coverings to vertex labellings with a condition at distance two
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- On \(L(d,1)\)-labelings of graphs
- Labelling graphs with the circular difference
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On generalized Petersen graphs labeled with a condition at distance two
- Distance-two labelings of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Labeling Chordal Graphs: Distance Two Condition
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- The edge span of distance two labellings of graphs
- Hamiltonicity and circular distance two labellings
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
