On the general position number of two classes of graphs

The general position problem is to find the cardinality of the largest vertex subset such that no triple of vertices of lies on a common geodesic. For a connected graph , the cardinality of is denoted by and called the -number (or general position number) of . In the paper, we obtain an upper bound...

Full description

Saved in:
Bibliographic Details
Published inOpen mathematics (Warsaw, Poland) Vol. 20; no. 1; pp. 1021 - 1029
Main Authors Yao, Yan, He, Mengya, Ji, Shengjin
Format Journal Article
LanguageEnglish
Published Warsaw De Gruyter 13.09.2022
De Gruyter Poland
Subjects
05C12
05C69
68Q25
Apexes
Cacti
cactus
general position set
Graph theory
Graphs
Lower bounds
Upper bounds
wheel
Online AccessGet full text

Cover

More Information
Summary:The general position problem is to find the cardinality of the largest vertex subset such that no triple of vertices of lies on a common geodesic. For a connected graph , the cardinality of is denoted by and called the -number (or general position number) of . In the paper, we obtain an upper bound and a lower bound regarding the -number in all cacti with cycles and pendant edges. Furthermore, the exact value of the -number on wheel graphs is determined.
ISSN:2391-5455
2391-5455
DOI:10.1515/math-2022-0444