Uniquely C4+-saturated graphs

Abstract

A graph G is uniquely H-saturated if it contains no copy of a graph H as a subgraph, but adding any new edge into G creates exactly one copy of H. Let C4+ be the diamond graph consisting of a 4-cycle C4 with one chord and C3* be the graph consisting of a triangle with a pendant edge. In this paper we prove that a nontrivial uniquely C4+-saturated graph G has girth 3 or 4. Further, G has girth 4 if and only if it is a strongly regular graph with special parameters. For n>18k2-24k+10 with k≥2, there are no uniquely C4+-saturated graphs on n vertices with k triangles. In particular, C3* is the only nontrivial uniquely C4+-saturated graph with one triangle, and there are no uniquely C4+-saturated graphs with two, three or four triangles.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…