On the hyperbolicity constant of circular-arc graphs
Combinatorics
2020-04-07 v1
Abstract
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in circular-arc graphs, which is an important class of geometric intersection graphs. In this paper we give sharp bounds for the hyperbolicity constant of (finite and infinite) circular-arc graphs. Moreover, we obtain bounds for the hyperbolicity constant of the complement and line of any circular-arc graph. In order to do that, we obtain new results about regular, chordal and line graphs which are interesting by themselves.
Keywords
Cite
@article{arxiv.2004.01754,
title = {On the hyperbolicity constant of circular-arc graphs},
author = {R. Reyes and J. M. Rodriguez and J. M. Sigarreta and M. Villeta},
journal= {arXiv preprint arXiv:2004.01754},
year = {2020}
}
Comments
arXiv admin note: text overlap with arXiv:1501.02288 by other authors