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.
图论中的一般位置问题要求图$G$的顶点的最大集合$S$使得$G$的最短路径不包含多于两个的$S$的顶点。在本文中,我们考虑一个变种的一般位置问题称为\emph{monophonic position problem},通过取代“最短路径”的“诱导路径"。本文证明了图的单音位置数的一些基本性质和界,并确定了一些图族的单音位置数,包括单圈图、二部图的补图和分裂图。我们证明了无三角形图的单音位置数是由独立数上界的。我们目前的实现结果的一般位置数,单声道位置数和单声道船体数。最后讨论了单声道位置问题的复杂性。
General position problems in strong and lexicographic products of graphs
Institute of Mathematics, Physics and Mechanics(数学、物理与力学研究所);Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院);School of Science, Zhejiang University of Science and Technology(浙江科技大学理学院)
Monophonic position sets of Cartesian and lexicographic products of graphs
Department of Mathematics, Mahatma Gandhi College, University of Kerala(喀拉拉大学马哈特玛甘地学院数学系);Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学物理学院);Institute of Mathematics, Physics and Mechanics(数学、物理和力学研究所);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院);School of Mathematics and Statistics, Open University(开放大学数学与统计学院)
Mutual-visibility and general position in double graphs and in Mycielskians
Cochin University of Science and Technology(科钦科技大学);University of Ljubljana(卢布尔雅那大学);Institute of Mathematics, Physics and Mechanics(数学、物理与力学研究所);University of Maribor(马里博尔大学)
Department of Mathematics, Mahatma Gandhi College, University of Kerala(喀拉拉大学马哈特玛甘地学院数学系);School of Mathematics, Open University(开放大学数学学院);Department of Mathematics, Greenshaw High School(格林肖高中数学系)
Mahatma Gandhi College(马哈特玛甘地学院);Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院);Institute of Mathematics, Physics and Mechanics(数学、力学和物理学研究所);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院);School of Mathematics and Statistics, Open University(开放大学数学与统计学院)
General position sets, colinear sets, and Sierpiński product graphs
Zhejiang University of Science and Technology(浙江科技大学);Institute of Mathematics, Physics and Mechanics(数学、物理和力学研究所);Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院)
Moving through Cartesian products, coronas and joins in general position
Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学物理学院);Institute of Mathematics, Physics and Mechanics, Ljubljana(卢布尔雅那数学、物理与力学研究所);Faculty of Natural Sciences and Mathematics, University of Maribor(马里博尔大学自然科学与数学学院);School of Mathematics and Statistics, Open University(开放大学数学与统计学院)