Steiner distance in product networks

Publication date: 10 December 2018

Abstract: For a connected graph

G

of order at least

2

and

S s u b s e t e q V (G)

, the emph{Steiner distance}

d_{G} (S)

among the vertices of

S

is the minimum size among all connected subgraphs whose vertex sets contain

S

. Let

n

and

k

be two integers with

2 l e q k l e q n

. Then the emph{Steiner

k

-eccentricity

e_{k} (v)

} of a vertex

v

of

G

is defined by

e_{k} (v) = m a x d_{G} (S), |, S s u b s e t e q V (G), | S | = k, a n d v i n S

. Furthermore, the emph{Steiner

k

-diameter} of

G

is

s d i a m_{k} (G) = m a x e_{k} (v), |, v i n V (G)

. In this paper, we investigate the Steiner distance and Steiner

k

-diameter of Cartesian and lexicographical product graphs. Also, we study the Steiner

k

-diameter of some networks.

Recommendations

Cited In (13)

This page was built for publication: Steiner distance in product networks