On the general position number of two classes of graphs
OPEN MATHEMATICS(2022)
Abstract
The general position problem is to find the cardinality of the largest vertex subset S such that no triple of vertices of S lies on a common geodesic. For a connected graphG, the cardinality of S is denoted by gp(G) and called the gp-number (or general position number) of G. In the paper, we obtain an upper bound and a lower bound regarding the gp-number in all cacti with k cycles and t pendant edges. Furthermore, the exact value of the gp-number on wheel graphs is determined.
MoreTranslated text
Key words
general position set, cactus, wheel
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined