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 条
  • [21] ON K-CONVERSION COEFFICIENT OF 393 KEV TRANSITION IN 113 IN
    TAJIBNAPIS, WD
    RAMASWAMY, MK
    [J]. NUOVO CIMENTO B, 1968, 55 (02): : 591 - +
  • [22] General lower bound on the size of (H; k)-stable graphs
    Zak, Andrzej
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (02) : 367 - 372
  • [23] A new lower bound on the maximum number of plane graphs using production matrices
    Huemer, Clemens
    Pilz, Alexander
    Silveira, Rodrigo, I
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 84 : 36 - 49
  • [24] Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of K12s+7
    Ren Han
    Gao Yanbo
    [J]. GRAPHS AND COMBINATORICS, 2011, 27 (02) : 187 - 197
  • [25] Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of K12s+7
    Ren Han
    Gao Yanbo
    [J]. Graphs and Combinatorics, 2011, 27 : 187 - 197
  • [26] K-CONVERSION COEFFICIENTS OF E2 TRANSITIONS
    RAMASWAMY, MK
    [J]. NUOVO CIMENTO, 1960, 18 (06): : 1287 - 1288
  • [27] THE INHERENT HALF-WIDTH OF K-CONVERSION LINES
    SLATIS, H
    LINDSTROM, G
    [J]. PHYSICAL REVIEW, 1952, 88 (06): : 1429 - 1429
  • [28] Irreversible k-Threshold Conversion Number of Circulant Graphs
    Shaheen, Ramy
    Mahfud, Suhail
    Kassem, Ali
    [J]. JOURNAL OF APPLIED MATHEMATICS, 2022, 2022
  • [29] k-FORESTED CHOOSABILITY OF GRAPHS WITH BOUNDED MAXIMUM AVERAGE DEGREE
    Zhang, X.
    Liu, G.
    Wu, J. -L.
    [J]. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2012, 38 (01): : 193 - 201
  • [30] The extreme eigenvalues and maximum degree of k-connected irregular graphs
    Chen, Xiaodan
    Hou, Yaoping
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 463 : 33 - 44
12345