On the general position set of two classes of graphs
Yan Yao,
Mengya He,
Shengjin Ji
et al.
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.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.