We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Independent Domination in Claw-Free Cubic Graphs
PeriodicalsMathematics

Independent Domination in Claw-Free Cubic Graphs

Checking your access to this record.

Abstract & Overview

Article Independent Domination in Claw-Free Cubic Graphs Linyu Li 1 and Jun Yue 2,* 1 School of Mathematics and Statistics, Shandong Normal University, Jinan 250358, China 2 School of Mathematics Science, Tiangong University, Tianjin 300387, China * Correspondence: yuejun06@126.com Received: 7 June 2024; Revised: 5 August 2024; Accepted: 13 August 2024; Published: 22 August 2024 Abstract: 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.

Cite this record

Linyu Li, Jun Yue (2024). Independent Domination in Claw-Free Cubic Graphs. Applied Mathematics and Statistics, 3–3. https://doi.org/10.53941/ams.2024.100003

Copy in another style

Li, L., & Yue, J. (2024). Independent Domination in Claw-Free Cubic Graphs. Applied Mathematics and Statistics, 3–3. https://doi.org/10.53941/ams.2024.100003
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.