论文标题
在两类图的一般位置集
On the general position set of two classes of graphs
论文作者
论文摘要
一般位置问题是找到最大的顶点子集的基数，以使得S的三个顶点都位于常见的大地测量上。对于连接的图G，S的基数用GP（G）表示，并称为GP的GP数字（或一般位置）G。在纸张中，我们在所有仙人掌中获得了带有K循环和T pendant边缘的所有仙人掌的上限和下限。此外，确定了车轮图的GP数字。
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.
