论文标题
确定旋塞图的数量：精确的值和改进的边界
Determining Number of Kneser Graphs: Exact Values and Improved Bounds
论文作者
论文摘要
图$ g =（v，e）$的确定编号是集合$ s \ subseteq v $的最小基数，因此在$ aut（g）$的动作下，$ s $的点稳定器是微不足道的。在本文中，我们在确定的旋塞图数量上提供了一些改进的上和下限。此外，我们提供了一些旋塞图的某些亚家族的确定数字的确切值。
The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we provide some improved upper and lower bounds on the determining number of Kneser graphs. Moreover, we provide the exact value of the determining number for some subfamilies of Kneser graphs.
