\(L(2,1)\)-labelings of Cartesian products of two cycles

DOI10.1016/j.dam.2005.12.006zbMath1089.05065OpenAlexW1981798582MaRDI QIDQ2492228

Christopher Schwarz, Denise Sakai Troxell

Publication date: 9 June 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.12.006

zbMATH Keywords

vertex labeling\(L(2distance two labeling1)\)-coloring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Communication theory (94A05)

Related Items (25)

The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ Backbone coloring for graphs with large girths ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ List backbone colouring of graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ Unnamed Item ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ Lambda number for the direct product of some family of graphs ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ Coloring the square of the Cartesian product of two cycles ⋮ \(L(2,1)\)-labelings on the composition of \(n\) graphs ⋮ L(1,1)-Labeling of direct product of cycles ⋮ Connectivity of Cartesian products of graphs ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ \(L(2,1)\)-labeling for brick product graphs ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths ⋮ L(h,k)-labelling for octagonal grid ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Distance-two labellings of Hamming graphs ⋮ Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE ⋮ 2-distance colorings of some direct products of paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On critical trees labeled with a condition at distance two
• 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
• No-hole \(L(2,1)\)-colorings
• On \(L(d,1)\)-labelings of graphs
• On generalized Petersen graphs labeled with a condition at distance two
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of 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
• Labeling Chordal Graphs: Distance Two Condition
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Hamiltonicity and circular distance two labellings

This page was built for publication: \(L(2,1)\)-labelings of Cartesian products of two cycles