Radio k-Labelings for Cartesian Products of Graphs
From MaRDI portal
Publication:3439363
DOI10.1016/j.endm.2005.06.078zbMath1200.05200MaRDI QIDQ3439363
Mustapha Kchikech, Riadh Khennoufa, Olivier Togni
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.078
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
Upper bound for radio -chromatic number of graphs in connection with partition of vertex set, Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\), ON RADIO NUMBER OF POWER OF CYCLES, Radio k-Labelings for Cartesian Products of Graphs
Cites Work