Distance-constrained labeling of complete trees

Veronika Halász, Z. Tuza

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Abstract We study vertex labelings φ:V → {0,1,2,...} of a graph G=(V,E) which assign nonnegative integers to the vertices and the restrictions depend on the distances in G. Fixing a positive integer d, the requirement is that if vertices u and v are at distance i apart (where 1≤i≤d), then |φ(u)-φ(v)|>d-i must hold. A corollary of the main result of this paper is an exact formula for the smallest possible value of maxv∈V φ(v) for trees whose internal vertices all have the same degree and all leaves are at distance d/2 from the central vertex (for d even) or at distance (d-1)/2 from the central edge (for d odd). The case of even diameter extends the main theorem of Li et al. (2010) on complete rooted trees with fixed down-degree and height.

Original languageEnglish
Article number10086
Pages (from-to)1398-1406
Number of pages9
JournalDiscrete Mathematics
Volume338
Issue number8
DOIs
Publication statusPublished - Aug 6 2015

Fingerprint

Labeling
Vertex Labeling
Integer
Rooted Trees
Assign
Corollary
Leaves
Odd
Non-negative
Restriction
Internal
Requirements
Graph in graph theory
Vertex of a graph
Theorem

Keywords

  • Complete tree
  • Graph coloring
  • Multi-level distance labeling
  • Radio labeling
  • Radio number

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Distance-constrained labeling of complete trees. / Halász, Veronika; Tuza, Z.

In: Discrete Mathematics, Vol. 338, No. 8, 10086, 06.08.2015, p. 1398-1406.

Research output: Contribution to journalArticle

Halász, Veronika ; Tuza, Z. / Distance-constrained labeling of complete trees. In: Discrete Mathematics. 2015 ; Vol. 338, No. 8. pp. 1398-1406.
@article{a9c688f1a4fd4b80b64e8d52057e43f1,
title = "Distance-constrained labeling of complete trees",
abstract = "Abstract We study vertex labelings φ:V → {0,1,2,...} of a graph G=(V,E) which assign nonnegative integers to the vertices and the restrictions depend on the distances in G. Fixing a positive integer d, the requirement is that if vertices u and v are at distance i apart (where 1≤i≤d), then |φ(u)-φ(v)|>d-i must hold. A corollary of the main result of this paper is an exact formula for the smallest possible value of maxv∈V φ(v) for trees whose internal vertices all have the same degree and all leaves are at distance d/2 from the central vertex (for d even) or at distance (d-1)/2 from the central edge (for d odd). The case of even diameter extends the main theorem of Li et al. (2010) on complete rooted trees with fixed down-degree and height.",
keywords = "Complete tree, Graph coloring, Multi-level distance labeling, Radio labeling, Radio number",
author = "Veronika Hal{\'a}sz and Z. Tuza",
year = "2015",
month = "8",
day = "6",
doi = "10.1016/j.disc.2015.02.016",
language = "English",
volume = "338",
pages = "1398--1406",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

T1 - Distance-constrained labeling of complete trees

AU - Halász, Veronika

AU - Tuza, Z.

PY - 2015/8/6

Y1 - 2015/8/6

N2 - Abstract We study vertex labelings φ:V → {0,1,2,...} of a graph G=(V,E) which assign nonnegative integers to the vertices and the restrictions depend on the distances in G. Fixing a positive integer d, the requirement is that if vertices u and v are at distance i apart (where 1≤i≤d), then |φ(u)-φ(v)|>d-i must hold. A corollary of the main result of this paper is an exact formula for the smallest possible value of maxv∈V φ(v) for trees whose internal vertices all have the same degree and all leaves are at distance d/2 from the central vertex (for d even) or at distance (d-1)/2 from the central edge (for d odd). The case of even diameter extends the main theorem of Li et al. (2010) on complete rooted trees with fixed down-degree and height.

AB - Abstract We study vertex labelings φ:V → {0,1,2,...} of a graph G=(V,E) which assign nonnegative integers to the vertices and the restrictions depend on the distances in G. Fixing a positive integer d, the requirement is that if vertices u and v are at distance i apart (where 1≤i≤d), then |φ(u)-φ(v)|>d-i must hold. A corollary of the main result of this paper is an exact formula for the smallest possible value of maxv∈V φ(v) for trees whose internal vertices all have the same degree and all leaves are at distance d/2 from the central vertex (for d even) or at distance (d-1)/2 from the central edge (for d odd). The case of even diameter extends the main theorem of Li et al. (2010) on complete rooted trees with fixed down-degree and height.

KW - Complete tree

KW - Graph coloring

KW - Multi-level distance labeling

KW - Radio labeling

KW - Radio number

UR - http://www.scopus.com/inward/record.url?scp=84925423995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925423995&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2015.02.016

DO - 10.1016/j.disc.2015.02.016

M3 - Article

AN - SCOPUS:84925423995

VL - 338

SP - 1398

EP - 1406

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 8

M1 - 10086

ER -