Estimations for the domination number of a graph
From MaRDI portal
Publication:912870
DOI10.1016/0012-365X(90)90114-WzbMath0699.05055OpenAlexW2044521543MaRDI QIDQ912870
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90114-w
Related Items (8)
Domination in commuting graph and its complement ⋮ On the non-cyclic graph of a group ⋮ Some upper bounds for the product of the domination number and the chromatic number of a graph ⋮ On restricted domination in graphs ⋮ Minimum partition of an independence system into independent sets ⋮ Domination number and neighbourhood conditions ⋮ On the domination and signed domination numbers of zero-divisor graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
This page was built for publication: Estimations for the domination number of a graph
