The L(2,1)-labeling and operations of graphs
From MaRDI portal
Publication:4590445
DOI10.1109/TCSI.2004.840484zbMATH Open1374.05195OpenAlexW1992815391MaRDI QIDQ4590445FDOQ4590445
Authors: Zhendong Shao, Roger K. 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
Recommendations
- \(L(2,1)\)-labeling in the context of some graph operations
- scientific article; zbMATH DE number 2073985
- \(L(2,1)\)-labeling of graphs: known results and open problems
- \(L(3,2,1)\)-labeling of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
- \(L (2,1,1)\)-labeling of simple graphs
- \(L(3,2,1)\)-labelling of graphs
- On \(L(d,1)\)-labelings of graphs
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)
Cited In (25)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- The \(L(2,1)\)-labeling on planar graphs
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- \(L(2,1)\)-labelling of generalized prisms
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- Distance two labeling on the square of a cycle
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
- Applications of automata and graphs: Labeling operators in Hilbert space. II.
- \(L\)-functions for images of graph coverings by some operations
- \(L(2, 1)\)-labeling of circulant graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- \(L(3,1)\)-labeling of circulant graphs
- Graph operations preserving \(W_{2}\)-property
- A survey on labeling graphs with a condition at distance two
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
- \(L(j, k)\)-number of direct product of path and cycle
- \(L(2,1)\)-labelings on the modular product of two graphs
This page was built for publication: The L(2,1)-labeling and operations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4590445)