Computation of twin-width of graphs

Kajal Das

Published 2022-07-28Version 1

Twin-width is a recently introduced graph parameter. In this article, we compute twin-width of various finite graphs. In particular, we prove that the twin-widths of finite graphs with 4 and 5 vertices are less than equal to 1 and 2, respectively. We show that the constructions of dual graph and line graph do not preserve twin-width. Also, we give upper bounds for the twin-width of King's graph and Rook's graph.