Abstract
A radio labeling of a connected graph is a function such that for every two distinct vertices and of The radio number of a graph is the smallest integer for which there exists a labeling with for all . The radio number of graphs of order and diameter , i.e., paths, was determined in \cite{paths}. Here we determine the radio numbers of all graphs of order and diameter .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.