Attributes | Values |
---|
rdf:type
| |
Description
| - Motivated by the Channel Assignment Problem, we study radio $k$-labelings of graphs. A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x) - c(y)| }= k+1 - d(x,y),$$ for any two distinct vertices $x$ and $y$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio $k$-labelings of distance graphs, i.e., graphs with the set $Z$ of integers as vertex set and in which two distinct vertices $i, j$ in $Z$ are adjacent if and only if $|i - j|$ is in $D$. We give some lower and upper bounds for radio $k$-labelings of distance graphs with distance sets $D={1,2,..., t}$, $D={1,t}$ and $D={t-1,t}$ for any positive integer $t}1$.
- Motivated by the Channel Assignment Problem, we study radio $k$-labelings of graphs. A radio $k$-labeling of a connected graph $G$ is an assignment $c$ of non negative integers to the vertices of $G$ such that $$|c(x) - c(y)| }= k+1 - d(x,y),$$ for any two distinct vertices $x$ and $y$, where $d(x,y)$ is the distance between $x$ and $y$ in $G$. In this paper, we study radio $k$-labelings of distance graphs, i.e., graphs with the set $Z$ of integers as vertex set and in which two distinct vertices $i, j$ in $Z$ are adjacent if and only if $|i - j|$ is in $D$. We give some lower and upper bounds for radio $k$-labelings of distance graphs with distance sets $D={1,2,..., t}$, $D={1,t}$ and $D={t-1,t}$ for any positive integer $t}1$. (en)
|
Title
| - Radio labelings of distance graphs
- Radio labelings of distance graphs (en)
|
skos:prefLabel
| - Radio labelings of distance graphs
- Radio labelings of distance graphs (en)
|
skos:notation
| - RIV/49777513:23520/13:43919556!RIV14-MSM-23520___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(ED1.1.00/02.0090), P(GBP202/12/G061)
|
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/49777513:23520/13:43919556
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - distance graph; radio k-labeling number; Graph labeling (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - Discrete Applied Mathematics
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Ekstein, Jan
- Holub, Přemysl
- Čada, Roman
- Togni, Olivier
|
issn
| |
number of pages
| |
http://bibframe.org/vocab/doi
| - 10.1016/j.dam.2013.06.024
|
http://localhost/t...ganizacniJednotka
| |