Paired-domination number of a graph and its complement
From MaRDI portal
Publication:998404
DOI10.1016/j.disc.2007.11.034zbMath1181.05067OpenAlexW1982249589MaRDI QIDQ998404
Seyyed Mahmoud Sheikholeslami, Hossein Karami, Odile Favaron
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.034
Related Items
Paired-domination subdivision numbers of graphs ⋮ Cubic graphs have paired-domination number at most four-seventh of their orders ⋮ Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs ⋮ Graphs with maximum size and given paired-domination number ⋮ An upper bound on the paired-domination number in terms of the number of edges in the graph ⋮ Paired Domination in Graphs ⋮ A proof of a conjecture on the paired-domination subdivision number
Cites Work
