The L(2,1)-labeling and operations of graphs
From MaRDI portal
Publication:4590445
DOI10.1109/TCSI.2004.840484zbMath1374.05195OpenAlexW1992815391MaRDI QIDQ4590445
Zhendong Shao, Roger K.-C. Yeh
Publication date: 20 November 2017
Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcsi.2004.840484
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)
Related Items (22)
\(L(2, 1)\)-labeling of circulant graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ The \(L(2,1)\)-labeling on planar graphs ⋮ \(L(2,1)\)-labelings on the modular product of two graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ \(L(2,1)\)-labelling of generalized prisms ⋮ Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ \(L(2,1)\)-labelings on the composition of \(n\) graphs ⋮ 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 ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE ⋮ THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
This page was built for publication: The L(2,1)-labeling and operations of graphs