Hangable Graphs

Publication date 24 December 2015

Abstract: Let

G = (V_{G}, E_{G})

be a connected graph. The distance

d_{G} (u, v)

between vertices

u

and

v

in

G

is the length of a shortest

u - v

path in

G

. The eccentricity of a vertex

v

in

G

is the integer

e_{G} (v) = m a x d_{G} (v, u) c o l o n u i n V_{G}

. The diameter of

G

is the integer

d (G) = m a x e_{G} (v) c o l o n v i n V_{G}

. The periphery of a~vertex

v

of

G

is the set

P_{G} (v) = u i n V_{G} c o l o n d_{G} (v, u) = e_{G} (v)

, while the periphery of

G

is the set

P (G) = v i n V_{G} c o l o n e_{G} (v) = d (G)

. We say that graph

G

is hangable if

P_{G} (v) s u b e q u a l P (G)

for every vertex

v

of

G

. In this paper we prove that every block graph is hangable and discuss the hangability of products of graphs.

This page was built for publication: Hangable Graphs