A structural approach for independent domination of regular graphs
type: Item
instance of: scholarly article
title: A structural approach for independent domination of regular graphs
zbMATH Open document ID: 1327.05167
author: Jeremy Lyle
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6484829
zbMATH Keywords: independent domination
zbMATH Keywords: maximal independent sets
zbMATH Keywords: regular graphs
MaRDI profile type: Publication
full work available at URL: s00373-014-1454-9
OpenAlex ID: W2007911652
cites work: Q3097395
cites work: Disjoint independent dominating sets in graphs
cites work: Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
cites work: On the Independent Domination Number of Random Regular Graphs
cites work: Gromov hyperbolic graphs
cites work: Two relations between the parameters of independence and irredundance
cites work: On the independent domination number of regular graphs
cites work: Upper bounds for independent domination in regular graphs
cites work: Independent dominating sets in regular 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: Q4766997
cites work: Coverings by minimal transversals
cites work: On hitting all maximum cliques with an independent set
cites work: Independent sets in regular graphs
cites work: A Note on "The Comparability Graph of a Tree"
cites work: Q4796200
DOI: 10.1007/S00373-014-1454-9
description: scientific article; zbMATH DE number 6484829