Maximum Number of Minimum Dominating and Minimum Total Dominating Sets

被引：0
|
作者：
Godbole, Anant [1 ]
Jamieson, Jessie D. [2 ]
Jamieson, William [2 ]
机构：
[1] E Tennessee State Univ, Johnson City, TN 37614 USA
[2] Univ Nebraska, Lincoln, NE USA
来源：
UTILITAS MATHEMATICA | 2014年 / 94卷
基金：
美国国家科学基金会;
关键词：
GRAPHS;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Given a connected graph with domination (or total domination) number gamma >= 2, we ask for the maximum number m(gamma) and m(T,gamma) of dominating and total dominating sets of size gamma. An exact answer is provided for gamma = 2 and lower bounds are given for m(gamma), m(T,gamma); gamma >= 3.
引用
收藏
页码：269 / 274
页数：6
相关论文
共 50 条
  • [1] UNIQUE MINIMUM SEMIPAIRED DOMINATING SETS IN TREES
    Haynes, Teresa W.
    Henning, Michael A.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (01) : 35 - 53
  • [2] Trees with unique minimum p-dominating sets
    Lu, You
    Hou, Xinmin
    Xu, Jun-Ming
    Li, Ning
    UTILITAS MATHEMATICA, 2011, 86 : 193 - 205
  • [3] A characterization of trees with unique minimum double dominating sets
    Chellali, Mustapha
    Haynes, Teresa W.
    UTILITAS MATHEMATICA, 2010, 83 : 233 - 242
  • [4] Minimum Dominating Sets in Scale-Free Network Ensembles
    Molnar, F., Jr.
    Sreenivasan, S.
    Szymanski, B. K.
    Korniss, G.
    SCIENTIFIC REPORTS, 2013, 3
  • [5] Minimum fractional dominating functions and maximum fractional packing functions
    Rubalcaba, R.
    Walsh, M.
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3280 - 3291
  • [6] Minimum Degree and Dominating Paths
    Faudree, Ralph J.
    Gould, Ronald J.
    Jacobson, Michael S.
    West, Douglas B.
    JOURNAL OF GRAPH THEORY, 2017, 84 (02) : 202 - 213
  • [7] EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPINSKI GASKET
    Zhou, Xiaotian
    Zhang, Zhongzhi
    FRACTALS-COMPLEX GEOMETRY PATTERNS AND SCALING IN NATURE AND SOCIETY, 2021, 29 (07)
  • [8] The Maximum Number of Dominating Induced Matchings
    Lin, Min Chih
    Moyano, Veronica A.
    Rautenbach, Dieter
    Szwarcfiter, Jayme L.
    JOURNAL OF GRAPH THEORY, 2015, 78 (04) : 258 - 268
  • [9] Original Finding the minimum k-weighted dominating sets using heuristic algorithms
    Barrena, E.
    Bermudo, S.
    Hernandez-Diaz, A. G.
    Lopez-Sanchez, A. D.
    Zamudio, J. A.
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2024, 228 : 485 - 497
  • [10] Proper connection number and connected dominating sets
    Li, Xueliang
    Wei, Meiqin
    Yue, Jun
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 480 - 487
12345