Independent dominating sets in regular graphs

DOI10.1007/S10878-011-9439-6zbMath1275.90116OpenAlexW2091835776MaRDI QIDQ358646

Julie Haviland

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9439-6

zbMATH Keywords

regular graphindependent domination numberextremal graph theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Dominating sets for uniform subset graphs ⋮ A structural approach for independent domination of regular graphs ⋮ Large hypertree width for sparse random hypergraphs

Cites Work

• Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
• Two relations between the parameters of independence and irredundance
• On minimum maximal independent sets of a graph
• On independent domination number of regular graphs
• Independent domination in regular graphs
• On the independent domination number of regular graphs
• Independent sets in regular graphs

This page was built for publication: Independent dominating sets in regular graphs