A LOWER BOUND ON THE k-CONVERSION NUMBER OF GRAPHS OF MAXIMUM DEGREE k

被引：0
|
作者：
Mynhardt, Christina M. [1 ]
Wodlinger, Jane L. [1 ]
机构：
[1] Univ Victoria, Dept Math & Stat, POB 3045, Victoria, BC, Canada
来源：
TRANSACTIONS ON COMBINATORICS | 2019年 / 8卷 / 03期
关键词：
Irreversible k-threshold Conversion Process; Conversion Number; Conversion St; INDUCED FORESTS; MONOPOLIES;
D O I：
10.22108/toc.2019.112258.1579
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We derive a new sharp lower bound on the k-conversion number of graphs of maximum degree k + 1. This generalizes a result of W. Staton [Induced forests in cubic graphs, Discrete Math., 49 (1984) 175-178], which established a lower bound on the k-conversion number of (k + 1)-regular graphs.
引用
收藏
页码：1 / 12
页数：12
相关论文
共 50 条
  • [1] The k-conversion number of regular graphs
    Mynhardt, Christina M.
    Wodlinger, Jane L.
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 955 - 965
  • [2] BOUNDS ON THE k-CONVERSION NUMBER
    Chellali, Mustapha
    Haynes, Teresa W.
    Hedetniemi, Stephen T.
    Meddah, Nacera
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024,
  • [3] LOWER BOUND OF THE HADWIGER NUMBER OF GRAPHS BY THEIR AVERAGE DEGREE
    KOSTOCHKA, AV
    [J]. COMBINATORICA, 1984, 4 (04) : 307 - 316
  • [4] ON DETERMINATION OF K-CONVERSION COEFFICIENTS
    SAHOTA, HS
    SOOD, BS
    [J]. CURRENT SCIENCE, 1967, 36 (22): : 601 - &
  • [5] THE MAXIMUM NUMBER OF EDGES IN 2K2-FREE GRAPHS OF BOUNDED DEGREE
    CHUNG, FRK
    GYARFAS, A
    TUZA, Z
    TROTTER, WT
    [J]. DISCRETE MATHEMATICS, 1990, 81 (02) : 129 - 135
  • [6] A better lower bound on the average degree of online k-list-critical graphs
    Rabern, Landon
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
  • [7] On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound
    Agustin, Ika Hesti
    Dafik
    Gembong, A. W.
    Alfarisi, Ridho
    [J]. INTERNATIONAL CONFERENCE ON MATHEMATICS: EDUCATION, THEORY AND APPLICATION, 2017, 855
  • [8] Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs
    Francis, M. D.
    Mynhardt, C. M.
    Wodlinger, J. L.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2019, 74 : 288 - 304
  • [9] A new lower bound on critical graphs with maximum degree of 8 and 9
    Li, Xuechao
    [J]. ARS COMBINATORIA, 2011, 98 : 241 - 257
  • [10] Sharp Upper Bounds on the k-Independence Number in Graphs with Given Minimum and Maximum Degree
    Suil, O.
    Shi, Yongtang
    Taoqiu, Zhenyu
    [J]. GRAPHS AND COMBINATORICS, 2021, 37 (02) : 393 - 408
12345