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 条
  • [41] The Connected Monophonic Number of a Graph
    Titus, P.
    Ganesamoorthy, K.
    [J]. GRAPHS AND COMBINATORICS, 2014, 30 (01) : 237 - 245
  • [42] UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS
    Liang, Yi-Ping
    Chen, Jie
    Xu, Shou-Jun
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2024, 109 (02) : 177 - 185
  • [43] Extremal values and bounds for the zero forcing number
    Gentner, Michael
    Penso, Lucia D.
    Rautenbach, Dieter
    Souza, Ueverton S.
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 214 : 196 - 200
  • [44] Relations between global forcing number and maximum anti-forcing number of a graph
    Zhang, Yaxian
    Zhang, Heping
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 311 : 85 - 96
  • [45] Bounds on a graph's security number
    Dutton, Ronald D.
    Lee, Robert
    Brigham, Robert C.
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (05) : 695 - 704
  • [46] Note on the Bounds on Wiener Number of a Graph
    Ramane, Harishchandra S.
    Manjalapur, Vinayak V.
    [J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2016, 76 (01) : 19 - 22
  • [47] BOUNDS FOR THE HARMONIOUS CHROMATIC NUMBER OF A GRAPH
    KRASIKOV, I
    RODITTY, Y
    [J]. JOURNAL OF GRAPH THEORY, 1994, 18 (02) : 205 - 209
  • [48] LOWER BOUNDS ON THE NUMBER OF TRIANGLES IN A GRAPH
    FISHER, DC
    [J]. JOURNAL OF GRAPH THEORY, 1989, 13 (04) : 505 - 512
  • [49] A COMPARISON OF BOUNDS FOR THE CHROMATIC NUMBER OF A GRAPH
    HASELGROVE, J
    SELIM, SM
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (03) : 259 - 260
  • [50] NEW BOUNDS FOR CLIQUE NUMBER OF A GRAPH
    SELKOW, SM
    [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 173 - 174
12345