Showing 361 - 380 results of 775 for search '"dominating set"', query time: 4.02s Refine Results
  1. 361
    by Lu, Chin Lung, 盧錦隆
    Published 1993
    ... subset D of V is called a k-dominating set of G if for every vertex x in V, there exists...
    Get full text
    Others
  2. 362
    by Bickle Allan
    Published 2013-05-01
    ...A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a...
    Get full text
    Article
  3. 363
    ...For a given simple graph $G=(V,E)$, a set $S\subseteq V$ is an outer-weakly convex dominating set...
    Get full text
    Article
  4. 364
    by S. Robinson Chellathurai, S. Padma Vijaya
    Published 2014-12-01
    ... shortest path between two vertices from S. A subset D of vertices in G is called dominating set if every...
    Get full text
    Article
  5. 365
    by McCoy, John Patrick
    Published 2013
    ... of these variants, paired-domination, requires that the subgraph induced by the dominating set contains a perfect...
    Get full text
  6. 366
    ...)$ respectively. An isolate set that is also a dominating set (an irredundant set) is an $\emph{isolate dominating...
    Get full text
    Article
  7. 367
    ...). A security concept was introduced in domination. A subset D of V(G) is called a dominating set of G...
    Get full text
    Article
  8. 368
    by Mong-Jen Kao, 高孟駿
    Published 2012
    ... for the entire problem. In terms of local demand supplying, we consider a generalization of the dominating set...
    Get full text
    Others
  9. 369
    by Dorfling, Samantha
    Published 2012
    ... to at least one vertex in D. Then D is called a dominating set of G and the smallest cardinality of such a...
    Get full text
  10. 370
    by Ying-Po Lee, 李映波
    Published 2003
    ... dominating set of graph theorem. Backbone architecture can be mapped to the connected dominating set of graph...
    Get full text
    Others
  11. 371
    ...Let be a graph and let be a family of subsets of such that A dominating set of is called...
    Get full text
    Article
  12. 372
    by Yang, Rue-Lin, 楊儒林
    Published 1998
    ...碩士 === 國立中正大學 === 資訊工程研究所 === 86 ===   An edge dominating set D of a graph G = (V, E) is a set...
    Get full text
    Others
  13. 373
    by Canoy, S.R., Jr, Gamorez, A.E
    Published 2022
    View Fulltext in Publisher
    Article
  14. 374
    by Xiaoyan Kui, Yu Sheng, Huakun Du, Junbin Liang
    Published 2013-04-01
    ..., many researches focus on using a connected dominating set to construct a virtual backbone for data...
    Get full text
    Article
  15. 375
    .... The proposed scheme uses connected dominating set at network layer where nodes in the connected dominating set...
    Get full text
    Article
  16. 376
    by Wei-Che Hung, 洪偉哲
    Published 2015
    ... different algorithms. First, the Disjoint WCDS algorithm which uses three dominating sets to extend the life...
    Get full text
    Others
  17. 377
    ...A paired-dominating set of a graph <i>G</i> without isolated vertices is a dominating set...
    Get full text
    Article
  18. 378
    by Si-Han Yang, 楊斯涵
    Published 2017
    ... vertex subset is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices...
    Get full text
    Others
  19. 379
    by Nader Jafari Rad, Elahe Sharifi
    Published 2015-05-01
    ...A subset $S$ of vertices in a graph $G$ is a \textit{global total dominating set}, or just GTDS...
    Get full text
    Article
  20. 380
    by Vaughan, Lamont D
    Published 2008
    ... double dominating set (DDS) if that set dominates every vertex of G twice. The double domination number...
    Get full text
    Get full text
    Others