English

Uniquely $C_{4}^{+}$-saturated graphs

Combinatorics 2024-12-25 v1

Abstract

A graph GG is uniquely HH-saturated if it contains no copy of a graph HH as a subgraph, but adding any new edge into GG creates exactly one copy of HH. Let C4+C_{4}^{+} be the diamond graph consisting of a 44-cycle C4C_{4} with one chord and C3C_{3}^{*} be the graph consisting of a triangle with a pendant edge. In this paper we prove that a nontrivial uniquely C4+C_{4}^{+}-saturated graph GG has girth 33 or 44. Further, GG has girth 44 if and only if it is a strongly regular graph with special parameters. For n>18k224k+10n>18k^{2}-24k+10 with k2k\geq2, there are no uniquely C4+C_{4}^{+}-saturated graphs on nn vertices with kk triangles. In particular, C3C_{3}^{*} is the only nontrivial uniquely C4+C_{4}^{+}-saturated graph with one triangle, and there are no uniquely C4+C_{4}^{+}-saturated graphs with two, three or four triangles.

Keywords

Cite

@article{arxiv.2412.17962,
  title  = {Uniquely $C_{4}^{+}$-saturated graphs},
  author = {Yuying Li and Kexiang Xu and Dániel Gerbner and Wenzhong Liu},
  journal= {arXiv preprint arXiv:2412.17962},
  year   = {2024}
}

Comments

14 pages, 2 figures

R2 v1 2026-06-28T20:47:24.811Z