The \(L(2,1)\)-labeling on Cartesian sum of graphs
From MaRDI portal
Publication:953888
DOI10.1016/j.aml.2007.08.010zbMath1156.05052DBLPjournals/appml/ShaoZ08OpenAlexW2044760886WikidataQ57810842 ScholiaQ57810842MaRDI QIDQ953888
Publication date: 6 November 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.08.010
Related Items (2)
\(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ Gromov hyperbolicity in the Cartesian sum of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(L(2,1)\)-labeling of strong products of cycles
- \(T\)-colorings of graphs: recent results and open problems
- Relating path coverings to vertex labellings with a condition at distance two
- On \(L(d,1)\)-labelings of graphs
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- Distance-two labelings of graphs
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- The L(2,1)-labeling and operations of graphs
- 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
This page was built for publication: The \(L(2,1)\)-labeling on Cartesian sum of graphs
