Counting the Number of Weakly Connected Dominating Sets of Graphs

被引：0
|
作者：
Alikhani, Saeid [1 ]
Jahari, Somayeh [1 ]
Mehryar, Mohammad [1 ]
机构：
[1] Yazd Univ, Dept Math, Yazd, Iran
来源：
MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES | 2016年 / 10卷 / 03期
关键词：
Dominating sets; Weakly connected; Path; Cycle;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G = (V(G); E(G)) be a simple graph. A non-empty set S subset of V (G) is a weakly connected dominating set in G, if the subgraph obtained from G by removing all edges each joining any two vertices in V (G) backslash S is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets.
引用
收藏
页码：297 / 306
页数：10
相关论文
共 50 条
  • [41] Counting the number of independent sets in chordal graphs
    Okamoto, Yoshio
    Uno, Takeaki
    Uehara, Ryuhei
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 229 - 242
  • [42] Counting the number of dissociation sets in cubic graphs
    Tu, Jianhua
    Xiao, Junyi
    Lang, Rongling
    [J]. AIMS MATHEMATICS, 2023, 8 (05): : 10021 - 10032
  • [43] On the number of edges in graphs with a given weakly connected domination number
    Sanchis, LA
    [J]. DISCRETE MATHEMATICS, 2002, 257 (01) : 111 - 124
  • [44] Efficient dominating sets in circulant graphs with domination number prime
    Deng, Yun-Ping
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (12) : 700 - 702
  • [45] Enumeration and maximum number of minimal dominating sets for chordal graphs
    Golovach, Petr A.
    Kratsch, Dieter
    Liedtoff, Mathieu
    Sayadi, Mohamed Yosri
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 783 : 41 - 52
  • [46] On the Number of Connected Sets in Bounded Degree Graphs
    Kangas, Kustaa
    Kaski, Petteri
    Koivisto, Mikko
    Korhonen, Janne H.
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 336 - 347
  • [47] CONNECTED GRAPHS WITH A LARGE NUMBER OF INDEPENDENT SETS
    Jou, Min-Jen
    [J]. TAIWANESE JOURNAL OF MATHEMATICS, 2013, 17 (06): : 2011 - 2017
  • [48] THE NUMBER OF MAXIMAL INDEPENDENT SETS IN CONNECTED GRAPHS
    FUREDI, Z
    [J]. JOURNAL OF GRAPH THEORY, 1987, 11 (04) : 463 - 470
  • [49] On the number of connected sets in bounded degree graphs
    Kangas, Kustaa
    Kaski, Petteri
    Korhonen, Janne H.
    Koivisto, Mikko
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (04):
  • [50] Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes
    Czyzowicz, J.
    Dobrev, S.
    Fevens, T.
    Gonzalez-Aguilar, H.
    Kranakis, E.
    Opatrny, J.
    Urrutia, J.
    [J]. LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 158 - +
12345