English

On the general position numbers of maximal outerplanar graphs

Combinatorics 2022-09-30 v1

Abstract

A subset RV(G)R\subseteq V(G) of a graph GG is a general position set if any triple set R0R_0 of RR is non-geodesic in GG, that is, no vertex of R0R_0 lies on any geodesic between the other two vertices of R0R_0 in GG. Let R\mathcal{R} be the set of general position sets of a graph GG. The general position number of a graph GG, denoted by gp(G)gp(G), is defined as gp(G)=max{R:RR}gp(G)=\max\{|R|:R\in\mathcal{R}\}. 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

R2 v1 2026-06-28T02:20:07.083Z