Some results on the saturation number for unions of cliques
Discrete Mathematics · 2024-04 · 347 (4) · 113868
DOI: 10.1016/j.disc.2023.113868 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2024-04. Verfasst von Fan Chen und 1 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 12 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
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 $K_p\cup (t-1)K_q$ ($t\geqslant 3$ and $2\leqslant p
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Chen, F., & Yuan, X. (2024). Some results on the saturation number for unions of cliques. Discrete Mathematics, 347(4), 113868. https://doi.org/10.1016/j.disc.2023.113868
Vancouver
Chen F, Yuan X. Some results on the saturation number for unions of cliques. Discrete Mathematics. 2024;347(4):113868. doi:10.1016/j.disc.2023.113868
BibTeX
@article{Chen2024,
author = {Chen, Fan and Yuan, Xiying},
title = {Some results on the saturation number for unions of cliques},
journal = {Discrete Mathematics},
year = {2024},
volume = {347},
number = {4},
pages = {113868},
doi = {10.1016/j.disc.2023.113868}
}
EUVIMED