\(L(2,1)\)-labeling for brick product graphs

DOI10.1007/S10878-014-9763-8zbMath1341.90138OpenAlexW50847809MaRDI QIDQ5963632

Zehui Shao, Roger K.-C. 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

zbMATH Keywords

graph labeling\(L(2,1)\)-labelingbrick product graphfrequency assignment problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (1)

On the \(L\)(2,~1)-labeling conjecture for brick product graphs

Cites Work

• \(L(2,1)\)-labeling of strong products of cycles
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• A survey on labeling graphs with a condition at distance two
• Exact Algorithms for L(2,1)-Labeling of Graphs
• Labelling Graphs with a Condition at Distance 2
• Approximations for  -Colorings of Graphs
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Automata, Languages and Programming

This page was built for publication: \(L(2,1)\)-labeling for brick product graphs