On the general position numbers of maximal outerplanar graphs
Jing Tian, Kexiang Xu, Daikun Chao

TL;DR
This paper investigates the maximum size of general position sets in maximal outerplanar graphs, establishing bounds and characterizing extremal graphs, thereby advancing understanding of graph geometric properties.
Contribution
It provides the first bounds on general position numbers for maximal outerplanar graphs and characterizes the extremal cases.
Findings
Established bounds on gp-numbers for maximal outerplanar graphs.
Characterized extremal graphs achieving these bounds.
Enhanced understanding of geometric properties in specific graph classes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Graph Labeling and Dimension Problems
