k-Distance Magic Labeling and Long Brush Graphs

arXiv2211.09666MaRDI QIDQ6417604FDOQ6417604

Publication date: 13 November 2022

Abstract: We define a labeling

f :

V (G)

i g h t a r r o w

1, 2, l d o t s, n

on a graph

G

of order

n g e q 3

as a emph{

k

-distance magic} (

k

-DM) if

s u m_{w i n p a r t i a l N_{k} (u)} f (w)

is a constant and independent of

u i n V (G)

where

p a r t i a l N_{k} (u)

=

v i n V (G) : d (u, v) = k

,

k i n m a t h b b N

. Graph

G

is called a emph{

k

-DM} if it has a

k

-DM labeling(L). Long Brush is a graph

G

with

V (G)

=

, a path

P_{n}

=

u_{1}

u_{2}

. . .

u_{n}

and

E (G)

=

E (P_{n})

c u p

i

= 1 to

c u p

E (< v_{1}, v_{2}, ..., v_{m} >)

,

m + n g e q 3

and

m, n i n m a t h b b N

. We denoted this graph by

L P_{n, m}

. In this paper, using partition techniques, we obtain families of

k

-DM graphs and prove that

(i)

For

k, n g e q 3

,

m g e q 2

and

k, m, n i n m a t h b b N

,

L P_{n, m}

is

k

-DM if and only if

m (m - 1) l e q 2 n

and

k

=

n

; (ii) For every

k i n m a t h b b N_{0}

and a given

m g e q 2

,

L P_{f r a c m (m - 1) 2 + k, m}

is a

(f r a c m (m - 1) 2 + k)

-DM graph; (iii) For

m g e q 3

,

L P_{1, m}

=

K_{1} (u_{1}) + (K_{m_{1}} c u p K_{m_{2}} c u p ... c u p K_{m_{x}})

,

x g e q 2

,

1 l e q m_{1} l e q m_{2} l e q ... l e q m_{x}

,

m_{1} + m_{2} + ... + m_{x}

=

m

,

m_{1} + m_{2} g e q 3

and

m_{1}, m_{2}, ..., m_{x}, x i n m a t h b b N

,

L P_{1, m}

is 2-DM if and only if

u_{1}

is assigned with a suitable

j

and

J_{m + 1} s e t m i n u s j

is partitioned into

x

constant sum partites of orders

m_{1}, m_{2}, ..., m_{x}

,

1 l e q j l e q m + 1

; (iv) For

m g e q 2

if

L P_{2, m}

contains two pendant vertices, then

L P_{2, m}

is not a

2

-DM graph; (v) For

m g e q 2

and

n g e q 3

, if

L P_{n, m}

contains three pendant vertices, then

L P_{n, m}

is not a

2

-DM graph; and (vi) for

m_{1}

= 1 to 22, we obtain all possible values of

m

for which

L P_{1, m}

=

u_{1} + (K_{m_{1}} c u p K_{m_{2}})

is 2-DM,

m_{1} l e q m_{2}

,

m = m_{1} + m_{2} g e q 3

and

m_{1}, m_{2} i n m a t h b b N

.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: $k$-Distance Magic Labeling and Long Brush Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417604)