Automorphisms and quotients of 2-colored quasi best match graphs
Combinatorics
2025-02-27 v1
Abstract
2-colored quasi best match graphs (2-qBMGs) are directed graphs that arose in phylogenetics. Investigations of 2-qBMGs have mostly focused on computational issues. However, 2-qBMGs also have relevant properties for structural graph theory; in particular, their undirected underlying graph is free from induced paths and cycles of size at least 6. In this paper, results on the structure of the automorphism groups of 2-qBMGs are obtained, which shows how to construct 2-qBMGs with large automorphism groups.
Cite
@article{arxiv.2502.18944,
title = {Automorphisms and quotients of 2-colored quasi best match graphs},
author = {Annachiara Korchmaros},
journal= {arXiv preprint arXiv:2502.18944},
year = {2025}
}