An improved upper bound on the independent domination number in cubic graphs of girth at least six
type: Item
instance of: scholarly article
title: An improved upper bound on the independent domination number in cubic graphs of girth at least six
zbMATH Open document ID: 1484.05148
author: G. Abrishami
author: Michael A. Henning
published in: Graphs and Combinatorics
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7490323
zbMATH Keywords: independent domination
zbMATH Keywords: cubic graphs
MaRDI profile type: Publication
full work available at URL: s00373-021-02446-y
OpenAlex ID: W4210604868
cites work: Independent domination in subcubic graphs of girth at least six
cites work: On independent domination in planar cubic graphs
cites work: What is the difference between the domination and independent domination numbers of a cubic graph?
cites work: Independent Domination in Cubic Graphs
cites work: Independent domination in graphs: A survey and recent results
cites work: On the independent domination number of regular graphs
cites work: Independent dominating sets in triangle-free graphs
cites work: Topics in Domination in Graphs
cites work: Structures of Domination in Graphs
cites work: Independent domination in subcubic bipartite graphs of girth at least six
cites work: Total Domination in Graphs
cites work: The independent domination number of a cubic 3-connected graph can be much larger than its domination number
cites work: On independent domination number of regular graphs
cites work: A note on independent sets in graphs with large minimum degree and small cliques
cites work: Cubic graphs with large ratio of independent domination number to domination number
cites work: Domination versus independent domination in cubic graphs
DOI: 10.1007/S00373-021-02446-Y
description: scientific article; zbMATH DE number 7490323