A set S of vertices is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G, denoted by \(\mathrm{Det}(G)\), is the smallest size of a determining set. In this paper, we give an explicit characterization for connected graphs of order n with determining number \(n-3\)

中文翻译：

---

确定编号为$$ n {-} 3 $$ n-3的n阶图形

一组小号顶点的是一个曲线图的确定组G ^如果每构ģ都唯一地由其上动作确定小号。由\（\ mathrm {Det}（G）\）表示的G的确定数是确定集的最小大小。在本文中，我们给出了顺序的连通图的明确表征Ñ与确定数目\（N-3 \）