L(2,1)-labeling for brick product graphs
From MaRDI portal
Publication:5963632
DOI10.1007/S10878-014-9763-8zbMATH Open1341.90138OpenAlexW50847809MaRDI QIDQ5963632FDOQ5963632
Authors: Zehui Shao, Roger K. Yeh, Jin Xu 
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9763-8
Recommendations
- On the \(L\)(2,~1)-labeling conjecture for brick product graphs
- \(L(2,1)\)-labelings on some products of \(n\) general graphs.
- \(L(2,1)\)-labelings on the modular product of two graphs
- scientific article; zbMATH DE number 2073985
- The \((2,1)\)-total labelling of the product of two kinds of graphs
- \(L(3,2,1)\)-labeling of graphs
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- \(L(2, 1)\)-labeling of circulant graphs
- On circular-L(2, 1)-labellings of products of graphs
- \(L(2,1)\)-labeling of block graphs.
Cites Work
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- Labelling Graphs with a Condition at Distance 2
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- A survey on labeling graphs with a condition at distance two
- \(L(2,1)\)-labeling of strong products of cycles
- Approximations for -Colorings of Graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- Exact Algorithms for L(2,1)-Labeling of Graphs
- Automata, Languages and Programming
Cited In (3)
This page was built for publication: \(L(2,1)\)-labeling for brick product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963632)
