A note on radio antipodal colourings of paths

Title:

A note on radio antipodal colourings of paths

Creator:

Khennoufa, Riadh and Togni, Olivier

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:9c4f50cb-f9c5-4786-a259-781ee5cce088
uuid:9c4f50cb-f9c5-4786-a259-781ee5cce088
doi:10.21136/MB.2005.134100

Subject:

radio antipodal colouring, radio number, and distance labeling

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The radio antipodal number of a graph G is the smallest integer c such that there exists an assignment f : V (G) → {1, 2, . . . , c} satisfying |f(u) − f(v)| ≥ D − d(u, v) for every two distinct vertices u and v of G, where D is the diameter of G. In this note we determine the exact value of the antipodal number of the path, thus answering the conjecture given in [G. Chartrand, D. Erwin and P. Zhang, Math. Bohem. 127 (2002), 57– 69]. We also show the connections between this colouring and radio labelings.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

277-282

Source:

Mathematica bohemica | 2005 Volume:130 | Number:3

Harvested from:

CDK

Metadata only:

false