Affiliation:
1. Department of Mathematics Emory University Atlanta Georgia USA
2. Department of Mathematics California State University San Marcos San Marcos California USA
Abstract
AbstractGiven a graph , we say that a graph is ‐saturated if is not a subgraph of , but the addition of any new edge to creates at least one copy of . In this paper we determine all pairs for which there is a ‐saturated graph on vertices and edges. In addition, we determine all but possible sizes for ‐vertex ‐saturated graphs when is an odd cycle for .
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference14 articles.
1. The edge spectrum of K4 ${K}_{4}$‐saturated graphs;Amin K.;J. Combin. Math. Combin. Comput,2012
2. On the non‐(p−1) $(p-1)$‐partite Kp ${K}_{p}$‐free graphs;Amin K.;Discuss. Math. Graph Theory,2013
3. Minimum C5 ${C}_{5}$ ‐saturated graphs;Chen Y.‐C.;J. Graph Theory,2009