Computation of twin-width of graphs
Combinatorics
2022-08-01 v1
Abstract
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.
Cite
@article{arxiv.2207.14333,
title = {Computation of twin-width of graphs},
author = {Kajal Das},
journal= {arXiv preprint arXiv:2207.14333},
year = {2022}
}
Comments
Comments are welcome!