On the general position numbers of maximal outerplanar graphs
Combinatorics
2022-09-30 v1
Abstract
A subset of a graph is a general position set if any triple set of is non-geodesic in , that is, no vertex of lies on any geodesic between the other two vertices of in . Let be the set of general position sets of a graph . The general position number of a graph , denoted by , is defined as . In this paper, we determine the bounds on the gp-numbers for any maximal outerplane graph and characterize the corresponding extremal graphs.
Keywords
Cite
@article{arxiv.2209.14476,
title = {On the general position numbers of maximal outerplanar graphs},
author = {Jing Tian and Kexiang Xu and Daikun Chao},
journal= {arXiv preprint arXiv:2209.14476},
year = {2022}
}
Comments
23 pages, 3 figures