文献类型：期刊文献

英文题名：Bowtie-saturated graphs and the spectral radius

作者：Ji, Xue[1,2];Dam, Edwin R. van[2];Guo, Ji-Ming[1];Wang, Zhiwen[1]

机构：[1]East China Univ Sci & Technol, Sch Math, Shanghai, Peoples R China;[2]Tilburg Univ, Dept Econometr & OR, Tilburg, Netherlands

年份：2026

卷号：349

期号：11

外文期刊名：DISCRETE MATHEMATICS

收录：;WOS:【SCI-EXPANDED(收录号:WOS:001793266100001)】；

语种：英文

外文关键词：Saturated graph; Spectral radius; Bowtie

摘要：A graph G is F-saturated (or uniquely F-saturated, resp.) if G does not contain F as a subgraph, but adding any edge to G results in a graph that contains a (or exactly one, resp.) copy of F. The bowtie graph F-2 is obtained from two triangles by sharing a common vertex. Li, Lu and Peng [Discrete Math. 2023] determined the maximum spectral radius for F-2-saturated graphs, giving a spectral strengthening of a theorem on ex(n, F-2) by Erdos, Furedi, Gould and Gunderson [J. Combin. Theory, Ser. B 1995]. The saturation number of F-2 for sufficiently large n was obtained by Faudree, Ferrara, Gould and Jacobson [Discrete Math. 2009]. Here we investigate the spectral version and prove that H-2,H-n is the unique graph with the minimum spectral radius among F-2-saturated graphs of order n >= 55, where H-2,H-n is obtained from the star S-n by embedding one triangle. Moreover, we show that there are no uniquely F-2-saturated graphs. (c) 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.