The Steiner 4-diameter of a graph

Authors Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye

Publication date 18 February 2017

Abstract: The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. 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, 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 (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 2011, Chartrand, Okamoto and Zhang showed that

k - 1 l e q s d i a m_{k} (G) l e q n - 1

. In this paper, graphs with

s d i a m_{4} (G) = 3, 4, n - 1

are characterized, respectively.

This page was built for publication: The Steiner 4-diameter of a graph

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