tK\(_p\)-saturated graphs of minimum size

DOI10.1016/j.disc.2008.06.036zbMath1229.05141OpenAlexW1994452179MaRDI QIDQ1045128

Michael Ferrara, Michael S. Jacobson, Ronald J. Gould, Ralph J. Faudree

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.036

zbMATH Keywords

saturationcomplete graphunion of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph operations (line graphs, products, etc.) (05C76)

Related Items (16)

A lower bound on the saturation number, and graphs for which it is sharp ⋮ The partite saturation number of spider ⋮ Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ Spectral radii of friendship graphs and their connected induced subgraphs ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ A note on the minimum size of matching-saturated graphs ⋮ Saturation numbers for linear forests $P_6 + tP_2$ ⋮ Some results on the saturation number for unions of cliques ⋮ On fan-saturated graphs ⋮ Induced saturation number ⋮ Core-satellite graphs: clustering, assortativity and spectral properties ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ The game of \(\mathcal F\)-saturator ⋮ Unnamed Item ⋮ Saturation numbers for disjoint stars ⋮ Minimum \(t P_3\)-saturation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graphic sequences with a realization containing a union of cliques
• Graphic sequences with a realization containing a generalized friendship graph
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• Saturated graphs with minimal number of edges
• A Problem in Graph Theory
• Constructive upper bounds for cycle-saturated graphs of minimum size

This page was built for publication: tK\(_p\)-saturated graphs of minimum size