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

图的 k-一般 d-位置问题

The k-general d-position problem for graphs

Brent Cody, Garrett Moore

AI总结:

本文定义并研究图的 k-一般 d-位置数,给出基于子图的界,计算路径、循环及二维网格等情形,并部分回答已有公开问题。

摘要:

如果图的一个顶点集中不存在三个顶点位于同一条测地线上,则称该顶点集处于一般位置。最近,Klavžar、Rall 和 Yero 推广了这一概念,将一个顶点集定义为处于一般 d-位置,如果该集合中不存在三个顶点位于一条长度至多为 d 的公共测地线上。我们进一步推广这一概念,将一个顶点集定义为处于 k-一般 d-位置,如果该集合中不存在 k 个顶点位于一条长度至多为 d 的公共测地线上。图的 k-一般 d-位置数是 k-一般 d-位置集的最大基数。我们依据某些类型子图的 k-一般 d-位置数,给出了图的 k-一般 d-位置数的上界和下界。我们计算了有限路径和循环的 k-一般 d-位置数。在此过程中,我们确立了循环的最大均匀子集——由 Clough 和 Douthett 在音乐理论研究中引入——在 n-循环中提供了可能最大的 k-一般 d-位置集。我们将 Klavžar 和 Manuel 的单调测地标号概念推广为 k-单调测地标号,以计算无限二维网格的 k-一般 d-位置数。我们还证明了某些薄有限网格的 k-一般 d-位置数公式,从而对 Klavžar、Rall 和 Yero 提出的一个问题给出了部分回答。

英文摘要:

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.

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

↑