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 条

[41] On the independence number of graphs with maximum degree 3
Kanj, Iyad
Zhang, Fenghui
[J]. THEORETICAL COMPUTER SCIENCE, 2013, 478 : 51 - 75
[42] Graphs with chromatic number close to maximum degree
Kostochka, Alexandr. V.
Rabern, Landon
Stiebitz, Michael
[J]. DISCRETE MATHEMATICS, 2012, 312 (06) : 1273 - 1281
[43] BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k, m)-DELETED GRAPHS
Zhou, Sizhong
Bian, Qiuxiang
Xu, Lan
[J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2012, 85 (01) : 60 - 67
[44] THE MAXIMUM NUMBER OF CHORDS OF A CYCLE IN K1.3-FREE GRAPHS
刘一平
[J]. Science Bulletin, 1990, (08) : 700 - 700
[45] K-CONVERSION COEFFICIENT OF DECAY OF OS191M
KIRSCHNER, H
[J]. ZEITSCHRIFT FUR PHYSIK, 1970, 232 (03): : 245 - +
[46] INTERNAL K-CONVERSION COEFFICIENTS OF TRANSITIONS IN W-182
ELFARRASH, AH
HAMID, MGA
[J]. ZEITSCHRIFT FUR PHYSIK, 1970, 236 (05): : 417 - +
[47] Lower bound for the number of critical points of minimal spectral k-partitions for k large
Helffer B.
[J]. Annales mathématiques du Québec, 2017, 41 (1) : 111 - 118
[48] On the lower bound for Bi(K)Bi(K*)
Zhao, Chang-Jian
[J]. BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2015, 22 (05) : 689 - 696
[49] An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
Miao, LY
Pang, SY
Wu, JL
[J]. DISCRETE MATHEMATICS, 2003, 271 (1-3) : 321 - 325
[50] Lower bounds on the signed total k-domination number of graphs
Volkmann, Lutz
[J]. AEQUATIONES MATHEMATICAE, 2016, 90 (02) : 271 - 279

← 1 2 3 4 5 →