This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
n18	http://localhost/temp/predkladatel/
n19	http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8	http://linked.opendata.cz/resource/domain/vavai/projekt/
n17	http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16	http://linked.opendata.cz/ontology/domain/vavai/
s	http://schema.org/
n4	http://linked.opendata.cz/ontology/domain/vavai/riv/
skos	http://www.w3.org/2004/02/skos/core#
n6	http://bibframe.org/vocab/
n2	http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
n12	http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5	http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F13%3A43919556%21RIV14-MSM-23520___/
n20	http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdh	http://www.w3.org/2001/XMLSchema#
n13	http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10	http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11	http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9	http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15	http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item

n2:RIV%2F49777513%3A23520%2F13%3A43919556%21RIV14-MSM-23520___

rdf:type

n16:Vysledek skos:Concept

dcterms: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$.

dcterms:title

Radio labelings of distance graphs Radio labelings of distance graphs

skos:prefLabel

Radio labelings of distance graphs Radio labelings of distance graphs

skos:notation

RIV/49777513:23520/13:43919556!RIV14-MSM-23520___

n16:predkladatel

n17:orjk%3A23520

n4:aktivita

n10:P

n4:aktivity

P(ED1.1.00/02.0090), P(GBP202/12/G061)

n4:cisloPeriodika

18

n4:dodaniDat

n15:2014

n4:domaciTvurceVysledku

n19:5395259 n19:2419033 n19:1675737

n4:druhVysledku

n11:J

n4:duvernostUdaju

n20:S

n4:entitaPredkladatele

n5:predkladatel

n4:idSjednocenehoVysledku

101336

n4:idVysledku

RIV/49777513:23520/13:43919556

n4:jazykVysledku

n13:eng

n4:klicovaSlova

distance graph; radio k-labeling number; Graph labeling

n4:klicoveSlovo

n12:radio%20k-labeling%20number n12:distance%20graph n12:Graph%20labeling

n4:kodStatuVydavatele

NL - Nizozemsko

n4:kontrolniKodProRIV

[CC0E14D7CF8D]

n4:nazevZdroje

Discrete Applied Mathematics

n4:obor

n9:BA

n4:pocetDomacichTvurcuVysledku

3

n4:pocetTvurcuVysledku

4

n4:projekt

n8:GBP202%2F12%2FG061 n8:ED1.1.00%2F02.0090

n4:rokUplatneniVysledku

n15:2013

n4:svazekPeriodika

161

n4:tvurceVysledku

Holub, Přemysl Ekstein, Jan Čada, Roman Togni, Olivier

s:issn

0166-218X

s:numberOfPages

9

n6:doi

10.1016/j.dam.2013.06.024

n18:organizacniJednotka

23520