Add to ORKGA radio labeling of a simple connected graph G is a function c:V(G) \to Z_+ such that for every two distinct vertices u and v of Gdistance(u,v)+|c(u)-c(v)|\geq 1+ diameter(G).The radio number of a graph G is the smallest integer M for which there exists a labeling c with c(v)\leq M for all v\in V(G). The radio number of graphs of order n and diameter n-1, i.e., paths, was determined in [7]. Here we determine the radio numbers of all graphs of order n and diameter n-2
Let G be a connected graph. The distance between two vertices u and v in G is defined by the length ...
International audienceMotivated by the Channel Assignment Problem, we study radio k-labelings of gra...
Abstract. Radio labeling is a variation of Hale’s channel assignment problem, in which one seeks to ...
A radio labeling of a simple connected graph G is a function c:V(G) \to Z_+ such that for every two...
A radio labeling of a connected graph G is a function c: V (G) → Z+ such that for every two distinc...
Let $\mathbb{N}$ be the set of positive integers. A radio labeling of a graph $G$ is a mapping $\var...
For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeli...
•The radio labeling of graphs originated from the real world problem of radio transmitter frequency ...
Let G be a connected graph with diameter d. For any two vertices u and v, let dG(u; v) denote the di...
We are investigating optimal radio labelings of radio stations that avoid radio interference between...
•The distance between any two vertices u, v of a graph G, d(u, v), is the length of the shortest pat...
AbstractA Radio Mean labeling of a connected graph G is a one to one map f from the vertex set V(G) ...
A radio labeling f of G is an assignment of positive integers to the vertices of G satisfying, │f (u...
Abstract. The radio number problem uses a graph-theoretical model to sim-ulate optimal frequency ass...
•The distance between any two vertices u, v of a graphG, d(u, v), is the length of the shortest path...
Let G be a connected graph. The distance between two vertices u and v in G is defined by the length ...
International audienceMotivated by the Channel Assignment Problem, we study radio k-labelings of gra...
Abstract. Radio labeling is a variation of Hale’s channel assignment problem, in which one seeks to ...
A radio labeling of a simple connected graph G is a function c:V(G) \to Z_+ such that for every two...
A radio labeling of a connected graph G is a function c: V (G) → Z+ such that for every two distinc...
Let $\mathbb{N}$ be the set of positive integers. A radio labeling of a graph $G$ is a mapping $\var...
For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeli...
•The radio labeling of graphs originated from the real world problem of radio transmitter frequency ...
Let G be a connected graph with diameter d. For any two vertices u and v, let dG(u; v) denote the di...
We are investigating optimal radio labelings of radio stations that avoid radio interference between...
•The distance between any two vertices u, v of a graph G, d(u, v), is the length of the shortest pat...
AbstractA Radio Mean labeling of a connected graph G is a one to one map f from the vertex set V(G) ...
A radio labeling f of G is an assignment of positive integers to the vertices of G satisfying, │f (u...
Abstract. The radio number problem uses a graph-theoretical model to sim-ulate optimal frequency ass...
•The distance between any two vertices u, v of a graphG, d(u, v), is the length of the shortest path...
Let G be a connected graph. The distance between two vertices u and v in G is defined by the length ...
International audienceMotivated by the Channel Assignment Problem, we study radio k-labelings of gra...
Abstract. Radio labeling is a variation of Hale’s channel assignment problem, in which one seeks to ...