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 条
  • [1] On the number of outer connected dominating sets of graphs
    Alikhani, S.
    Akhbari, M. H.
    Eslahchi, C.
    Hasni, R.
    UTILITAS MATHEMATICA, 2013, 91 : 99 - 107
  • [2] Dominating Sets and Connected Dominating Sets in Dynamic Graphs
    Hjuler, Niklas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    Saulpic, David
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [3] Weakly Convex Hop Dominating Sets in Graphs
    Canoy Jr, Sergio R.
    Hassan, Javier A.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (02): : 1196 - 1211
  • [4] Randomised algorithms for finding small weakly-connected dominating sets of regular graphs
    Duckworth, W
    Mans, B
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2003, 2653 : 83 - 95
  • [5] Counting dominating sets and related structures in graphs
    Cutler, Jonathan
    Radcliffe, A. J.
    DISCRETE MATHEMATICS, 2016, 339 (05) : 1593 - 1599
  • [6] On the number of fair dominating sets of graphs
    Alikhani, Saeid
    Safazadeh, Maryam
    ADVANCED STUDIES-EURO-TBILISI MATHEMATICAL JOURNAL, 2023, 16 : 59 - 69
  • [7] Linear separation of connected dominating sets in graphs
    Chiarelli, Nina
    Milanic, Martin
    ARS MATHEMATICA CONTEMPORANEA, 2019, 16 (02) : 487 - 525
  • [8] Connected dominating sets on dynamic geometric graphs
    Guibas, Leonidas
    Milosavljevic, Nikola
    Motskin, Arik
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2013, 46 (02): : 160 - 172
  • [9] Counting the number of dominating sets of cactus chains
    Alikhani, S.
    Jahari, S.
    Mehryar, M.
    Hasni, R.
    OPTOELECTRONICS AND ADVANCED MATERIALS-RAPID COMMUNICATIONS, 2014, 8 (9-10): : 955 - 960
  • [10] Weakly connected resolving sets in graphs
    Sivakumar, J.
    Baskar, A. Wilson
    Sundareswaran, R.
    Swaminathan, V.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (08)
12345