scientific article
From MaRDI portal
Publication:3073573
zbMath1224.05451MaRDI QIDQ3073573
Melanie Xie, Daphne Der-Fen Liu
Publication date: 11 February 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of graph theory (05C90) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Radio mean labeling of a graph ⋮ On the radio number of square of graphs ⋮ Radio secure number of a graph ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Further results on the radio number of trees ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Antipodal number of some powers of cycles ⋮ On radio \(k\)-labeling of the power of the infinite path ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Radio number for total graph of paths ⋮ Radio number of trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio number of trees ⋮ Radio labelings of distance graphs ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Antipodal number of full \(m\)-ary trees ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Radio number for trees ⋮ \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle ⋮ Radio $k$-labeling of paths ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs ⋮ Radio number for the product of a path and a complete graph
