TY - JOUR
T1 - An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six
AU - Abrishami, Gholamreza
AU - Henning, Michael A.
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature.
PY - 2022/4
Y1 - 2022/4
N2 - Henning et al. (Discrete Appl Math 162:399–403, 2014) proved that if G is a bipartite, cubic graph of order n and of girth at least 6, then i(G)≤411n. In this paper, we improve the 411-bound to a 514-bound, and prove that if G is a bipartite, cubic graph of order n and of girth at least 6, then i(G)≤514n.
AB - Henning et al. (Discrete Appl Math 162:399–403, 2014) proved that if G is a bipartite, cubic graph of order n and of girth at least 6, then i(G)≤411n. In this paper, we improve the 411-bound to a 514-bound, and prove that if G is a bipartite, cubic graph of order n and of girth at least 6, then i(G)≤514n.
KW - Cubic graphs
KW - Independent domination
UR - http://www.scopus.com/inward/record.url?scp=85123985036&partnerID=8YFLogxK
U2 - 10.1007/s00373-021-02446-y
DO - 10.1007/s00373-021-02446-y
M3 - Article
AN - SCOPUS:85123985036
SN - 0911-0119
VL - 38
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
IS - 2
M1 - 50
ER -