Radio number of Hamming graphs of diameter 3

Abstract: For

G

a simple, connected graph, a vertex labeling

f : V (G) i g h t a r r o w m a t h b b Z_{+}

is called a

e x t i t r a d i o l a b e l i n g o f

G

if it satisfies

| f (u) - f (v) | g e q o p e r a t o r n a m e d i a m (G) + 1 - d (u, v)

for all distinct vertices

u, v i n V (G)

. The

e x t i t r a d i o n u m b e r

of

G

is the minimal span over all radio labelings of

G

. If a bijective radio labeling onto

1, 2, ..., | V (G) |

exists,

G

is called a

e x t i t r a d i o g r a c e f u l g r a p h

. We determine the radio number of all diameter

3

Hamming graphs and show that an infinite subset of them is radio graceful.

Recommendations

Cited In (7)

This page was built for publication: Radio number of Hamming graphs of diameter 3