scientific article; zbMATH DE number 2188457
From MaRDI portal
Publication:5461564
zbMath1071.05573MaRDI QIDQ5461564
Publication date: 26 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Radio mean labeling of a graph ⋮ Radio numbers of some caterpillars ⋮ Radio secure number of a graph ⋮ Further results on the radio number of trees ⋮ Radio number of trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio number of trees ⋮ 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 ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ Radio numbers of certain \(m\)-distant trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees
This page was built for publication:
