On the general position set of two classes of graphs

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 upp...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Yao, Yan, He, Mengya, Ji, Shengjin, Li, Guang
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 08.02.2020
Subjects
Apexes
Graph theory
Lower bounds
Upper bounds
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422