Total Vertex Irregularity Strength of Forests

Abstract: We investigate a graph parameter called the total vertex irregularity strength (

t v s (G)

), i.e. the minimal

s

such that there is a labeling

w : E (G) c u p V (G) i g h t a r r o w 1, 2, .., s

of the edges and vertices of

G

giving distinct weighted degrees

w t_{G} (v) := w (v) + s u m_{v i n e i n E (G)} w (e)

for every pair of vertices of

G

. We prove that

t v s (F) = l c e i l (n_{1} + 1) / 2 c e i l

for every forest

F

with no vertices of degree 2 and no isolated vertices, where

n_{1}

is the number of pendant vertices in

F

. Stronger results for trees were recently proved by Nurdin et al.

This page was built for publication: Total Vertex Irregularity Strength of Forests