Radio number for the product of a path and a complete graph

DOI10.1007/s10878-013-9639-3zbMath1316.05105OpenAlexW2001389909MaRDI QIDQ2352358

Byung Chul Song, Woonjae Hwang, Byeong Moon Kim

Publication date: 1 July 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-013-9639-3

zbMATH Keywords

Cartesian productchannel assignment problemmultilevel distance labelingradio number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

On the radio number for corona of paths and cycles ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Distance two labelling and direct products of graphs
• Distance three labelings for direct products of three complete graphs
• Radio number for trees
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• A survey on labeling graphs with a condition at distance two
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Radio number of ladder graphs
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• Multilevel Distance Labelings for Paths and Cycles
• Structural Information and Communication Complexity

This page was built for publication: Radio number for the product of a path and a complete graph