Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'504'928
Articles rated: 2609

25 April 2024

» arxiv » 1610.3115

Article overview

Note on Nordhaus-Gaddum problems for power domination
Katherine F. Benson ; Daniela Ferrero ; Mary Flagg ; Veronika Furst ; Leslie Hogben ; Violeta Vasilevska ;
Date:	11 Oct 2016
Abstract:	The upper and lower Nordhaus-Gaddum bounds over all graphs for the power domination number follow from known bounds on the domination number and examples. In this note we improve the upper sum bound for the power domination number substantially for graphs having the property that both the graph and its complement must be connected. For these graphs, our bound is tight and is also significantly better than the corresponding bound for domination number. We also improve the product upper bound for the power domination number for graphs with certain properties.
Source:	arXiv, 1610.3115
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap