Independent Domination in Claw-Free Cubic Graphs
Applied Mathematics and Statistics · 2024
DOI: 10.53941/ams.2024.100003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Mathematics and Statistics, 2024. Verfasst von Linyu Li und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A vertex set S of a graph G is called an independent dominating set if S is an independent set and each vertex in V(G)\S is adjacent to a vertex in S. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G. This paper first proves that if G is a connected \(K_{1,3}\)-free cubic graph, then \(i(G)\leq \frac{1}{3}|V(G)|\). Meanwhile, \(i(G)=\frac{1}{3}|V(G)|\) if and only if \(G\in \mathcal{H}\), where \(\mathcal{H}\) is an infinite cubic family with each graph being a \(C_6^+\)-necklace. Then, it is shown that if G is a \(\{K_{1,3}, K_4^-, C_6^+\}\)-free cubic graph with no \(C_3\Box K_2\)-component, then \(i(G)\leq \frac{5}{18}|V(G)|\). This result is tight.
Zitieren
APA
Li, L., & Yue, J. (2024). Independent Domination in Claw-Free Cubic Graphs. Applied Mathematics and Statistics. https://doi.org/10.53941/ams.2024.100003
Vancouver
Li L, Yue J. Independent Domination in Claw-Free Cubic Graphs. Applied Mathematics and Statistics. 2024. doi:10.53941/ams.2024.100003
BibTeX
@article{Li2024,
author = {Li, Linyu and Yue, Jun},
title = {Independent Domination in Claw-Free Cubic Graphs},
journal = {Applied Mathematics and Statistics},
year = {2024},
doi = {10.53941/ams.2024.100003}
}
EUVIMED