The Radio numbers of all graphs of order nn and diameter n−2n-2

preprint2012arXivOpen access

Abstract

A radio labeling of a connected graph GG is a function c:V(G)→Z+c:V(G) \to \mathbb Z_+ such that for every two distinct vertices uu and vv of GG distance(u,v)+∣c(u)−c(v)∣≥1+diameter(G).\text{distance}(u,v)+|c(u)-c(v)|\geq 1+ \text{diameter}(G). The radio number of a graph GG is the smallest integer MM for which there exists a labeling cc with c(v)≤Mc(v)\leq M for all v∈V(G)v\in V(G). The radio number of graphs of order nn and diameter n−1n-1, i.e., paths, was determined in \cite{paths}. Here we determine the radio numbers of all graphs of order nn and diameter n−2n-2.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.