The existence of C4-saturated graphs having sizes close to the lower bound
Utilitas Mathematica · 10.05.2026 · 127 · 141-151
DOI: 10.61091/um127-10 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, online erschienen am 10.05.2026. Verfasst von Pennapa Chodok und 2 weiteren Autor:innen.
Abstract (Originalsprache)
A graph \(G\) is \(H\)-saturated if \(G\) does not have \(H\) as a subgraph but \(G + uv\) has at least one copy of \(H\) for any edge \(uv \notin E(G)\). The smallest number of edges of all \(H\)-saturated graphs of order \(n\) is called \(H\)-saturation number and is denoted by \(sat(n; H)\). In this paper, we establish the existence of \(C_{4}\)-saturated graphs with prescribed the number of edges in some length that is close to \(sat(n; C_{4})\).
Zitieren
APA
Chodok, P., Songsuwan, N., & Kaemawichanurat, P. (2026). The existence of C4-saturated graphs having sizes close to the lower bound. Utilitas Mathematica, 127, 141-151. https://doi.org/10.61091/um127-10
Vancouver
Chodok P, Songsuwan N, Kaemawichanurat P. The existence of C4-saturated graphs having sizes close to the lower bound. Utilitas Mathematica. 2026;127:141-151. doi:10.61091/um127-10
BibTeX
@article{Chodok2026,
author = {Chodok, Pennapa and Songsuwan, Nuttanon and Kaemawichanurat, Pawaton},
title = {The existence of C4-saturated graphs having sizes close to the lower bound},
journal = {Utilitas Mathematica},
year = {2026},
volume = {127},
pages = {141--151},
doi = {10.61091/um127-10}
}
EUVIMED