On \(L(2,1)\)-labelings of Cartesian products of paths and cycles

DOI10.1016/j.disc.2003.11.009zbMath1043.05104OpenAlexW1990710940MaRDI QIDQ1827783

Yanyan Li

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.009

zbMATH Keywords

cyclepathCartesian productgrid\(L(2,1)\)-labeling\(L(2,1)\)-labeling numberlambda-coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (35)

Total edge irregularity strength of generalized prism ⋮ Total vertex irregularity strength of generalized prism graphs ⋮ The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ Acyclic colorings of products of trees ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ Labeling crossed prisms with a condition at distance two ⋮ The \(L(2,1)\)-labeling on planar graphs ⋮ Distance-two labelings of digraphs ⋮ 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 ⋮ Some algebraic polynomials and topological indices of generalized prism and toroidal polyhex networks ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ \(L(2,1)\)-labelling of generalized prisms ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ List backbone colouring of graphs ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ On theL(2, 1)-labelling of block graphs ⋮ Unnamed Item ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ Lambda number for the direct product of some family of graphs ⋮ Coloring the square of the Cartesian product of two cycles ⋮ A survey on labeling graphs with a condition at distance two ⋮ \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths ⋮ The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ On circular-L(2, 1)-labellings of products of graphs

Cites Work

• Relating path coverings to vertex labellings with a condition at distance two
• On \(L(d,1)\)-labelings of graphs
• Labelling graphs with the circular difference
• Distance-two labelings of graphs
• 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 the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• The edge span of distance two labellings of graphs
• Hamiltonicity and circular distance two labellings
• Fixed-parameter complexity of \(\lambda\)-labelings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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