Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Discrete Mathematics and Combinatorics
Induced Subgraph Saturated Graphs, Craig M. Tennenhouse
Induced Subgraph Saturated Graphs, Craig M. Tennenhouse
Theory and Applications of Graphs
A graph G is said to be H-saturated if G contains no subgraph isomorphic to H but the addition of any edge between non-adjacent vertices in G creates one. While induced subgraphs are often studied in the extremal case with regard to the removal of edges, we extend saturation to induced subgraphs. We say that G is induced H-saturated if G contains no induced subgraph isomorphic to H and the addition of any edge to G results in an induced copy of H. We demonstrate constructively that there are non-trivial examples of saturated graphs for …