English

A complete characterisation of vertex-multiplications of trees with diameter 5

Combinatorics 2021-11-18 v1

Abstract

Koh and Tay introduced a new family of graphs, GG vertex-multiplications, as an extension of complete nn-partite graphs. They proved a fundamental classification of GG vertex-multiplications into three classes C0,C1\mathscr{C}_0, \mathscr{C}_1 and C2\mathscr{C}_2. It was shown that any vertex-multiplication of a tree with diameter at least 3 does not belong to the class C2\mathscr{C}_2. Furthermore, for vertex-multiplications of trees with diameter 55, some necessary and sufficient conditions for C0\mathscr{C}_0 were established. In this paper, we give a complete characterisation of vertex-multiplications of trees with diameter 55 in C0\mathscr{C}_0 and C1\mathscr{C}_1.

Keywords

Cite

@article{arxiv.2007.06399,
  title  = {A complete characterisation of vertex-multiplications of trees with diameter 5},
  author = {W. H. W. Wong and E. G. Tay},
  journal= {arXiv preprint arXiv:2007.06399},
  year   = {2021}
}

Comments

9 pages