A graph is uniquely -saturated if it contains no copy of a graph as a subgraph, but adding any new edge into creates exactly one copy of . Let be the diamond graph consisting of a -cycle with one chord and be the graph consisting of a triangle with a pendant edge. In this paper we prove that a nontrivial uniquely -saturated graph has girth or . Further, has girth if and only if it is a strongly regular graph with special parameters. For with , there are no uniquely -saturated graphs on vertices with triangles. In particular, is the only nontrivial uniquely -saturated graph with one triangle, and there are no uniquely -saturated graphs with two, three or four triangles.

生成讲解博客的中文版本

生成AI智能校验的中文版本