WorksMathematics
Uniquely -saturated graphs with large maximum degree
Abstract
A graph is \textit{uniquely -saturated} if it contains no copy of as a subgraph, but adding any edge to creates exactly one copy of in the resultant graph. In this paper, we consider the uniquely -saturated graphs and characterize the uniquely -saturated graphs on vertices with maximum degree . We prove that if is a uniquely -saturated graph with universal vertex , then is either a star or a Moore graph of diameter 2. The uniquely -saturated graphs with maximum degrees and are and in Figure 2, respectively. But there are no uniquely -saturated graphs with maximum degree or .