arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.09130math.CO
收藏

图论一般位置问题

Graph theory general position problem

Paul Manuel, Sandi Klavžar

摘要:

经典的不三点成一直线问题是找到可以放置在$n \times n$网格中的最大点数,使得没有三个点位于一条直线上。给定欧氏平面中的点的集合$S$,一般位置子集选择问题是找到$S$的最大子集$S'$,使得$S'$中没有三个点共线。出于这些问题,下面的图论的变化是介绍:给定一个图$G$,确定一个最大的集$S$的顶点$G$,使没有三个顶点的$S$位于一个共同的测地线。这样的集合是$G$的gp集合,并且其大小是$G$的gp编号${\rm gp}(G)$。给出了${\rm gp}(G)$在不同等距覆盖下的上界,并用于确定几类图的gp-数.研究了一般位置集与填充之间的关系,并给出了GP数的下界。证明了一般位置问题是NP-完全的。

英文摘要:

The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset Selection Problem is to find a maximum subset $S'$ of $S$ such that no three points of $S'$ are collinear. Motivated by these problems, the following graph theory variation is introduced: Given a graph $G$, determine a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is a gp-set of $G$ and its size is the gp-number ${\rm gp}(G)$ of $G$. Upper bounds on ${\rm gp}(G)$ in terms of different isometric covers are given and used to determine the gp-number of several classes of graphs. Connections between general position sets and packings are investigated and used to give lower bounds on the gp-number. It is also proved that the general position problem is NP-complete.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑