\(L(h,k)\)-labelings of Hamming graphs

DOI10.1016/j.disc.2008.04.049zbMath1211.05146OpenAlexW2006427206MaRDI QIDQ1025475

Liang-Hao Huang, Gerard Jennhwa Chang

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.049

zbMATH Keywords

Hamming graphCartesian productcomplete graphk)\)-labeling\(L(hk)\)-number

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE

Uses Software

• CALMA

Cites Work

• Unnamed Item
• Unnamed Item
• On \(L(d,1)\)-labelings of graphs
• A survey on labeling graphs with a condition at distance two
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• On labeling the vertices of products of complete graphs with distance constraints
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• Labelling Cayley Graphs on Abelian Groups
• Models and solution techniques for frequency assignment problems

This page was built for publication: \(L(h,k)\)-labelings of Hamming graphs