### Results for "Devsi Bantva"

total 7took 0.01s
A lower bound for the radio number of graphsMar 13 2019A radio labeling of a graph $G$ is a mapping $\vp : V(G) \rightarrow \{0, 1, 2,...\}$ such that $|\vp(u)-\vp(v)|\geq \diam(G) + 1 - d(u,v)$ for every pair of distinct vertices $u,v$ of $G$, where $\diam(G)$ and $d(u,v)$ are the diameter of $G$ and distance ... More
Further results on the radio number of treesMay 25 2018Let $G$ be a finite, connected, undirected graph with diameter $diam(G)$ and $d(u,v)$ denote the distance between $u$ and $v$ in $G$. A radio labeling of a graph $G$ is a mapping $f: V(G) \rightarrow \{0,1,2,...\}$ such that $|f(u)-f(v)| \geq diam(G) ... More On hamiltonian colorings of block graphsSep 09 2016A hamiltonian coloring c of a graph G of order p is an assignment of colors to the vertices of G such that$D(u,v)+|c(u)-c(v)|\geq p-1$for every two distinct vertices u and v of G, where D(u,v) denoted the detour distance between u and v. The value hc(c) ... More Radio number for middle graph of pathsMay 25 2018For a connected graph$G$, let$diam(G)$and$d(u,v)$denote the diameter of$G$and distance between$u$and$v$in$G$. A radio labeling of a graph$G$is a mapping$\varphi : V(G) \rightarrow \{0,1,2,...\}$such that$|\varphi(u)-\varphi(v)| \geq diam(G) ... More
On hamiltonian colorings of treesOct 01 2016A hamiltonian coloring $c$ of a graph $G$ of order $n$ is a mapping $c$ : $V(G) \rightarrow \{0,1,2,...\}$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n-1$, for every two distinct vertices $u$ and $v$ of $G$, where $D(u, v)$ denotes the detour distance ... More
Hamiltonian chromatic number of block graphsJan 17 2019Let $G$ be a simple connected graph of order $n$. A hamiltonian coloring $c$ of a graph $G$ is an assignment of colors (non-negative integers) to the vertices of $G$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n - 1$ for every two distinct vertices ... More
Radio number of treesSep 10 2016A radio labeling of a graph $G$ is a mapping $f: V(G) \rightarrow \{0, 1, 2, \ldots\}$ such that $|f(u)-f(v)|\geq d + 1 - d(u,v)$ for every pair of distinct vertices $u, v$ of $G$, where $d$ is the diameter of $G$ and $d(u,v)$ the distance between $u$ ... More