Bounds on the Connected Forcing Number of a Graph

被引：0
|
作者：
Randy Davila
Michael A. Henning
Colton Magnant
Ryan Pepper
机构：
[1] University of Johannesburg,Department of Pure and Applied Mathematics
[2] Georgia Southern University,Department of Mathematical Sciences
[3] University of Houston–Downtown,Department of Mathematics and Statistics
来源：
Graphs and Combinatorics | 2018年 / 34卷
关键词：
Zero forcing sets; Zero forcing number; Connected dominating sets; Connected domination number; Girth; 05C69; 05C50;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected forcing number in terms of the minimum degree, maximum degree, girth, and order of the graph.
引用
收藏
页码：1159 / 1174
页数：15
相关论文
共 50 条
  • [31] Forcing Independent Domination Number of a Graph
    Armada, Cris L.
    Canoy, Sergio, Jr.
    [J]. EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2019, 12 (04): : 1371 - 1381
  • [32] ON THE CHROMATIC FORCING NUMBER OF A RANDOM GRAPH
    MCDIARMID, C
    [J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 123 - 132
  • [33] The forcing near geodetic number of a graph
    Lenin, R.
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (02)
  • [34] FORCING DETOUR MONOPHONIC NUMBER OF A GRAPH
    Titus, P.
    Ganesamoorthy, K.
    [J]. FACTA UNIVERSITATIS-SERIES MATHEMATICS AND INFORMATICS, 2013, 28 (02): : 211 - 220
  • [35] The forcing edge covering number of a graph
    John, J.
    Vijayan, A.
    Sujitha, S.
    [J]. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2011, 14 (03): : 249 - 259
  • [36] THE FORCING HOP DOMINATION NUMBER OF A GRAPH
    Anusha, D.
    Robin, S. Joseph
    [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2020, 25 (01): : 55 - 70
  • [37] Forcing geodesic number of a fuzzy graph
    Rehmani, S.
    Sunitha, M. S.
    [J]. 3RD INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND STATISTICS, 2018, 1132
  • [38] The Connected Monophonic Number of a Graph
    P. Titus
    K. Ganesamoorthy
    [J]. Graphs and Combinatorics, 2014, 30 : 237 - 245
  • [39] On the connected monophonic number of a graph
    Ganesamoorthy, K.
    Murugan, M.
    Santhakumaran, A. P.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2022, 7 (02) : 139 - 148
  • [40] Connected domsaturation number of a graph
    Arumugam, S
    Kala, R
    [J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2004, 35 (10): : 1215 - 1221
12345