A lower bound on the $k$-conversion number of graphs of maximum degree $k+۱$
Publish place: Transactions on Combinatorics، Vol: 8، Issue: 3
Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 130
This Paper With 12 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-8-3_001
تاریخ نمایه سازی: 14 اردیبهشت 1400
Abstract:
We derive a new sharp lower bound on the $k$-conversion number of graphs of maximum degree $k+۱$. This generalizes a result of W.~Staton [Induced forests in cubic graphs, Discrete Math.,۴۹ (۱۹۸۴) ۱۷۵--۱۷۸], which established a lower bound on the $k$-conversion number of $(k+۱)$-regular graphs.
Keywords:
irreversible k-threshold conversion process , network diffusion process , conversion number , conversion set
Authors
Christina Mynhardt
Department of Mathematics and Statistics University of Victoria
Jane Wodlinger
Department of Mathematics and Statistics, University of Victoria