An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six

Gholamreza Abrishami; Michael A. Henning

doi:10.1007/s00373-021-02446-y

An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six

Gholamreza Abrishami
, Michael A. Henning

Mathematics and Applied Mathematics

Ferdowsi University of Mashhad

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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.

Original language	English
Article number	50
Journal	Graphs and Combinatorics
Volume	38
Issue number	2
DOIs	https://doi.org/10.1007/s00373-021-02446-y
Publication status	Published - Apr 2022

Keywords

Cubic graphs
Independent domination

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/s00373-021-02446-y

Cite this

@article{82f63701712d43eb99a5c530f761eed0,

title = "An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six",

abstract = "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.",

keywords = "Cubic graphs, Independent domination",

author = "Gholamreza Abrishami and Henning, \{Michael A.\}",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature.",

year = "2022",

month = apr,

doi = "10.1007/s00373-021-02446-y",

language = "English",

volume = "38",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "2",

}

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.

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 - https://www.scopus.com/pages/publications/85123985036

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 -

An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this