# Hangable graphs Mateusz Miotk and Jerzy Topp

**Abstract:** 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)= \max\{ d_G(v,u) \colon u\in V_G\}$. The diameter of $G$ is the integer $d(G)= \max\{e_G(v)\colon v\in V_G\}$. The periphery of a~vertex $v$ of $G$ is the set $P_G(v)= \{u\in V_G\colon d_G(v,u)= e_G(v)\}$, while the periphery of $G$ is the set $P(G)= \{v\in V_G\colon e_G(v)=d(G)\}$. A graph $G$ is said to be hangable if $P_G(v)\subseteq 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.

**Keywords:** Hangability; Diameter; Block graph.

**How to cite this article:**

Mateusz Miotk and Jerzy Topp, Hangable graphs, International Journal of Advances in Mathematics, Volume 2018, Number 4, Pages 44-50, 2018.