On the general position set of two classes of graphs

2020/02/08 by Yan Yao, Yao, Yan, Mengya He +5
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.2002.03108

openalex publication_date 2020/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The general position problem is to find the cardinality of a largest vertex subset S such that no triple of vertices of S lie on a common geodesic. For a connected graph G, the cardinality of S is denoted by gp(G) and called gp-number (or general position number) of G. In the paper, we obtain an upper bound and a lower bound regarding gp-number in all cactus with k cycles and t pendant edges. Furthermore, the gp-number of wheel graph is determined.

Related

• Characterization of classes of graphs with large general position number
• The general position problem on Kneser graphs and on some graph operations
• On general position sets in Cartesian products
• General d-position sets
• Edge general position problem