|
|
|
|
A LOWER BOUND ON THE k-CONVERSION NUMBER OF GRAPHS OF MAXIMUM DEGREE k + 1
|
|
|
|
|
|
|
|
نویسنده
|
mynhardt christina m. ,wodlinger jane l.
|
|
منبع
|
transactions on combinatorics - 2019 - دوره : 8 - شماره : 3 - صفحه:1 -12
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Irreversible k-threshold Conversion Process ,Conversion Number ,Conversion St
|
|
آدرس
|
university of victoria, department of mathematics and statistics, Canada, university of victoria, department of mathematics and statistics, Canada
|
|
پست الکترونیکی
|
jw@uvic.ca
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|