On the general position numbers of maximal outerplane graphs

DOI10.1007/S40840-023-01592-1MaRDI QIDQ6090821zbMATH OpenFDO

Authors Jing Tian, Kexiang Xu, Daikun Chao

Publication date 20 November 2023

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.14476

zbMATH Keywords

general position numbergeneral position setmaximal outerplane graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Graph operations (line graphs, products, etc.) (05C76)

Abstract: A subset $RsubseteqV(G)$ of a graph $G$ is a general position set if any triple set $R_0$ of $R$ is non-geodesic in $G$, that is, no vertex of $R_0$ lies on any geodesic between the other two vertices of $R_0$ in $G$. Let $mathcalR$ be the set of general position sets of a graph $G$. The general position number of a graph $G$, denoted by $gp(G)$, is defined as $gp(G)=max|R|:RinmathcalR$. In this paper, we determine the bounds on the gp-numbers for any maximal outerplane graph and characterize the corresponding extremal graphs.

Recommendations

• On the general position number of two classes of graphs
• A generalization of outerplanar graphs
• scientific article; zbMATH DE number 1382377
• scientific article; zbMATH DE number 4008413
• A note on domination number in maximal outerplanar graphs
• scientific article; zbMATH DE number 3878973
• On the degree sequences of maximal outerplanar graphs.
• Adjacency posets of outerplanar graphs
• On the vertex separation of maximal outerplanar graphs
• On dominating sets of maximal outerplanar graphs

Cites work

• A combinatorial theorem in plane geometry
• A general position problem in graph theory
• A Steiner general position problem in graph theory
• Algebraic characterizations of outerplanar and planar graphs
• Characterization of general position sets and its applications to cographs and bipartite graphs
• Characterizations of outerplanar graphs
• Convex dominating sets in maximal outerplanar graphs
• Distance-hereditary graphs
• Dominating sets in planar graphs
• Dominating sets in triangulations on surfaces
• Edge general position sets in Fibonacci and Lucas cubes
• General d-position sets
• Graph theory with applications
• scientific article; zbMATH DE number 6096647 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• Isolation number of maximal outerplanar graphs
• On dominating sets of maximal outerplanar graphs
• On general position sets in Cartesian products
• On the General Position Number of Complementary Prisms
• On the general position number of two classes of graphs
• On the general position problem on Kneser graphs
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• Resistance distance in straight linear 2-trees
• The edge general position problem
• The general position number of Cartesian products involving a factor with small diameter
• The general position number of integer lattices
• The general position number of the Cartesian product of two trees
• The general position problem and strong resolving graphs
• The general position problem on Kneser graphs and on some graph operations
• The graph theory general position problem on some interconnection networks

Cited in

(14)

• Extremal edge general position sets in some graphs
• On the general position number of Mycielskian graphs
• On the general position number of the k -th power graphs
• A note on the edge general position number of cactus graphs
• General position sets, colinear sets, and Sierpiński product graphs
• Coloring the vertices of a graph with mutual-visibility property
• The general position number under vertex and edge removal
• The edge general position number of some graphs
• Graphs whose edge general position number is 4
• Mutual-visibility and general position in double graphs and in Mycielskians
• Generalization of edge general position problem
• On the variety of general position problems under vertex and edge removal
• On the number of matchings in maximal outerplanar graphs
• Monophonic position sets of Cartesian and lexicographic products of graphs

This page was built for publication: On the general position numbers of maximal outerplane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090821)