Abstract
Graph G is H-saturated if H is not a subgraph of G and H is a subgraph of G+e for any edge e not in G. The saturation number for a graph H is the minimal number of edges in any H-saturated graph of order n. In this paper, the saturation number for Kp∪(t−1)Kq (t⩾3 and 2⩽p<q) is determined, and the extremal graph for Kp∪2Kq is determined. Moreover, the saturation number and the extremal graph for Kp∪Kq∪Kr (r⩾p+q) are completely determined.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
