On the independent domination number of graphs with given minimum degree
From MaRDI portal
Publication:1584339
DOI10.1016/S0012-365X(97)00267-7zbMath0956.05076OpenAlexW1985666785MaRDI QIDQ1584339
N. I. Glebov, Alexandr V. Kostochka
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00267-7
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Independent domination in directed graphs ⋮ On upper transversals in 3-uniform hypergraphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Extremal connected graphs for independent domination number ⋮ Independent domination number in Cayley digraphs of rectangular groups ⋮ Independent Domination in Triangle Graphs
Cites Work
This page was built for publication: On the independent domination number of graphs with given minimum degree