scholarly journals Minimal graphs with disjoint dominating\\ and paired-dominating sets

2020 ◽  
Author(s):  
Michael .A. Henning ◽  
Jerzy Topp
Keyword(s):  
Dominating Sets ◽  
Minimal Graphs

Algorithms to Compute some Dominating Sets of ES (N, K) and ESC (N, K)

2014 ◽  
Vol 4 (1) ◽  
pp. 35
Author(s):  
Pious Missier ◽  
Anto Kinsley ◽  
Evangeline Prathibha Fernando
Keyword(s):  
Dominating Sets

On Ramsey Minimal Graphs

10.37236/1184 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Tomasz Łuczak
Keyword(s):  
Infinite Number ◽  
Probabilistic Argument ◽  
Minimal Graphs

An elementary probabilistic argument is presented which shows that for every forest $F$ other than a matching, and every graph $G$ containing a cycle, there exists an infinite number of graphs $J$ such that $J\to (F,G)$ but if we delete from $J$ any edge $e$ the graph $J-e$ obtained in this way does not have this property.

scholarly journals Locating and paired-dominating sets in graphs

2009 ◽  
Vol 157 (15) ◽  
pp. 3268-3280 ◽  
Author(s):  
John McCoy ◽  
Michael A. Henning
Keyword(s):  
Dominating Sets

scholarly journals Efficient enumeration of dominating sets for sparse graphs

2021 ◽  
Author(s):  
Kazuhiro Kurita ◽  
Kunihiro Wasa ◽  
Hiroki Arimura ◽  
Takeaki Uno
Keyword(s):  
Dominating Sets ◽  
Sparse Graphs

Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks

2009 ◽  
Vol 20 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Donghyun Kim ◽  
Yiwei Wu ◽  
Yingshu Li ◽  
Feng Zou ◽  
Ding-Zhu Du
Keyword(s):  
Wireless Networks ◽  
Dominating Sets ◽  
Connected Dominating Sets
Sign in / Sign up

Export Citation Format

Share Document