Home > Journals > TAG > Vol. 8 (2021) > Iss. 2

#### Abstract

For a connected graph $G$, let $\mathscr{D}(G)$ be the family of strong orientations of $G$; and for any $D\in\mathscr{D}(G)$, we denote by $d(D)$ the diameter of $D$. The $\textit{orientation number}$ of $G$ is defined as $\bar{d}(G)=\min\{d(D)\mid D\in \mathscr{D}(G)\}$. In 2000, Koh and Tay introduced a new family of graphs, $G$ vertex-multiplications, and extended the results on the orientation number of complete $n$-partite graphs. Suppose $G$ has the vertex set $V(G)=\{v_1,v_2,\ldots, v_n\}$. For any sequence of $n$ positive integers $(s_i)$, a $G$ \textit{vertex-multiplication}, denoted by $G(s_1, s_2,\ldots, s_n)$, is the graph with vertex set $V^*=\bigcup_{i=1}^n{V_i}$ and edge set $E^*$, where $V_i$'s are pairwise disjoint sets with $|V_i|=s_i$, for $i=1,2,\ldots,n$; and for any $u,v\in V^*$, $uv\in E^*$ if and only if $u\in V_i$ and $v\in V_j$ for some $i,j\in \{1,2,\ldots, n\}$ with $i\neq j$ such that $v_i v_j\in E(G)$. They proved a fundamental classification of $G$ vertex-multiplications, with $s_i\ge 2$ for all $i=1,2,\ldots, n$, into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\mathscr{C}_2$, and any vertex-multiplication of a tree with diameter at least 3 does not belong to the class $\mathscr{C}_2$. Furthermore, some necessary and sufficient conditions for $\mathscr{C}_0$ were established for vertex-multiplications of trees with diameter $5$. In this paper, we give a complete characterisation of vertex-multiplications of trees with diameter $5$ in $\mathscr{C}_0$ and $\mathscr{C}_1$.

#### Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

#### Recommended Citation

Wong, Willie Han Wah and Tay, Eng Guan
(2021)
"A Complete Characterisation of Vertex-multiplications of Trees with Diameter 5,"
*Theory and Applications of Graphs*: Vol. 8
:
Iss.
2
, Article 6.

DOI: 10.20429/tag.2021.080206

Available at:
https://digitalcommons.georgiasouthern.edu/tag/vol8/iss2/6