Multilevel Distance Labelings for Paths and Cycles
From MaRDI portal
Publication:5470782
DOI10.1137/S0895480102417768zbMath1095.05033OpenAlexW2056891496MaRDI QIDQ5470782
Xuding Zhu, Daphne Der-Fen Liu
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480102417768
Related Items (51)
ON RADIO NUMBER OF POWER OF CYCLES ⋮ Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Radio mean labeling of a graph ⋮ Radio numbers of some caterpillars ⋮ Radio secure number of a graph ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ New results on radio \(k\)-labelings of distance graphs ⋮ On the radio \(k\)-chromatic number of some classes of trees ⋮ Further results on the radio number of trees ⋮ Radio number for middle graph of paths ⋮ On radio connection number of graphs ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Antipodal number of some powers of cycles ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ 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 the Cartesian product of two trees ⋮ Radio k-chromatic number of cycles for large k ⋮ Radio number for total graph of paths ⋮ Unnamed Item ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Radio number of trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio number of trees ⋮ Radio labelings of distance graphs ⋮ Improved lower bounds for the radio number of trees ⋮ Optimal radio-\(k\)-labelings of trees ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ 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 ⋮ A lower bound technique for radio \(k\)-coloring ⋮ \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle ⋮ Radio $k$-labeling of paths ⋮ The radio number of (Wn: 2) graphs ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\) ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ Radio numbers of certain \(m\)-distant trees ⋮ On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups ⋮ Multilevel Bandwidth and Radio Labelings of Graphs ⋮ Antipodal radio labelling of full binary trees ⋮ Radio number of ladder graphs ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Distance three labellings for K n ×K 2 ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs ⋮ Radio k-Labelings for Cartesian Products of Graphs ⋮ Radio number for the product of a path and a complete graph
This page was built for publication: Multilevel Distance Labelings for Paths and Cycles
