Radio labelings of graphs
From MaRDI portal
The authors the define radio labeling of a connected graph \(G=(V,E)\) as assignment \(c\) of distinct positive integers to the vertices of \(G\), such that \(d(u,v)+|c(u)-c(v)|\geq 1+\text{diam}(G)\) for every two distinct vertices \(u,v\in V\). (\(\text{dist}(u,v)\) is the distance between \(u\) and \(v\), and \(\text{diam}(G)\) is the diameter of \(G\).) The authors study the radio labeling problem on some graph classes. They provide some results for cycles and prove several results concerning connected graphs of diameter 2.
Recommendations
Cited in
(76)- Greedy \(F\)-colorings of graphs
- Hamiltonian colorings of graphs
- A note on collections of graphs with non-surjective lambda labelings
- On Hamiltonian colorings of graphs
- Radio number for total graph of paths
- Antipodal number of full \(m\)-ary trees
- Radio numbers of certain \(m\)-distant trees
- On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups
- Antipodal radio labelling of full binary trees
- Radio \(k\)-chromatic number of full \(m\)-ary trees
- New results on radio \(k\)-labelings of distance graphs
- Improved lower bounds for the radio number of trees
- Optimal radio labellings of block graphs and line graphs of trees
- Radio fuzzy graphs and assignment of frequency in radio stations
- Distance-constrained labeling of complete trees
- Radio number for the product of a path and a complete graph
- Further results on the radio number of trees
- Radio number for middle graph of paths
- Radio labelings of distance graphs
- Radio number for trees
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- On the radio \(k\)-chromatic number of some classes of trees
- The radio number of \(C_n\square C_n\).
- The radio numbers of all graphs of order n and diameter n-2
- Radio mean labeling of a graph
- Radio numbers of some caterpillars
- Radio secure number of a graph
- Radio graceful Hamming graphs
- Radio number of graphs of diameter three
- \(K_n\square P\) is radio graceful
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- Radio labeling of some ladder-related graphs
- A new graph radio k-coloring algorithm
- scientific article; zbMATH DE number 2154968 (Why is no real title available?)
- On characterizing radio k-coloring problem by path covering problem
- A lower bound for radio \(k\)-chromatic number
- Radio number for middle graph of dandelion
- scientific article; zbMATH DE number 7601456 (Why is no real title available?)
- Radio Graceful Labelling of Graphs
- A lower bound technique for radio k-coloring
- On the radio number for corona of paths and cycles
- Upper bound for radio k-chromatic number of graphs in connection with partition of vertex set
- Radio \(k\)-labeling of paths
- scientific article; zbMATH DE number 7090175 (Why is no real title available?)
- Distance edge coloring and collision-free communication in wireless sensor networks
- scientific article; zbMATH DE number 6723768 (Why is no real title available?)
- Radio number of graphs with small diameter
- Multilevel Bandwidth and Radio Labelings of Graphs
- scientific article; zbMATH DE number 2188457 (Why is no real title available?)
- scientific article; zbMATH DE number 6470676 (Why is no real title available?)
- Relationship between radio \(k\)-chromatic number of graphs and square graphs
- Radio number of trees
- Radio number of trees
- One point union of paths of cycles and their k-numbers
- scientific article; zbMATH DE number 7725444 (Why is no real title available?)
- On radio k-labeling of the power of the infinite path
- A linear algorithm for radio \(k\)-coloring powers of paths having small diameter
- An improved lower bound for the radio k-chromatic number of the hypercube qn
- n-fold L(2, 1)-labelings of Cartesian product of paths and cycles
- A different approach for multi-level distance labellings of path structure networks
- Radio labeling of certain networks
- A study on avoiding RFI in the movement of robots via radio resolving number problem
- A linear algorithm for radio k-coloring of powers of paths having small diameters
- The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\)
- The radio \(k\)-chromatic number for corona of graphs
- Antipodal number of Cartesian product of complete graphs with cycles
- A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements
- Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree
- Radio labelling of two-branch trees
- Radio labeling of biconvex split graphs
- Radio number of the Cartesian product of a tree and a complete graph
- Radio number of Cartesian products of complete bipartite graphs and odd cycles
- On real number labelings and graph invertibility
- Radio number of zero divisor graphs induced by product of three primes
- Radio gracefulness of Moore graphs and beyond
- Optimal radio labellings of complete m-ary trees
This page was built for publication: Radio labelings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765170)
