Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube

DOI10.1007/s10878-012-9568-6zbMath1331.90092OpenAlexW2045359810MaRDI QIDQ489710

Wai Chee Shiu, Peter Che Bor Lam, Hai-ying Zhou

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9568-6

zbMATH Keywords

channel assignment problem\(n\)-cubedistance two labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• List \(T\)-colorings of graphs
• On \(L(d,1)\)-labelings of graphs
• Pair Labellings with Given Distance
• Labelling Graphs with a Condition at Distance 2
• Further Results on T-Coloring and Frequency Assignment Problems
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube