A set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common geodesic. Recently Klavžar, Rall and Yero generalized this notion by defining a set of vertices to be in general $d$-position if no three vertices from the set lie on a common geodesic of length at most $d$. We generalize this notion further by defining a set of vertices to be in $k$-general $d$-position if no $k$ vertices of the set lie on a common geodesic of length at most $d$. The $k$-general $d$-position number of a graph is the largest cardinality of a $k$-general $d$-position set. We provide upper and lower bounds on the $k$-general $d$-position number of graphs in terms of the $k$-general $d$-position number of certain kinds of subgraphs. We compute the $k$-general $d$-position number of finite paths and cycles. Along the way we establish that the maximally even subsets of cycles, which were introduced in Clough and Douthett's work on music theory, provide the largest possible $k$-general $d$-position sets in $n$-cycles. We generalize Klavžar and Manuel's notion of monotone-geodesic labeling to that of $k$-monotone-geodesic labeling in order to calculate the $k$-general $d$-position number of the infinite two-dimensional grid. We also prove a formula for the $k$-general $d$-position number of certain thin finite grids, providing a partial answer to a question asked by Klavžar, Rall and Yero.
图论中的一般位置问题要求图$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(开放大学数学与统计学院)