On the zero forcing number of graphs and their splitting graphs

• Опубліковано в: : Algebra and Discrete Mathematics
• Дата: 2019
• Автори: Chacko, B., Dominic, C., Premodkumar, K.P.
• Формат: Стаття
• Мова: English
• Опубліковано: Інститут прикладної математики і механіки НАН України 2019
• Онлайн доступ: https://nasplib.isofts.kiev.ua/handle/123456789/188475
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Цитувати: On the zero forcing number of graphs and their splitting graphs / B. Chacko, C. Dominic, K.P. Premodkumar // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 1. — С. 29–43. — Бібліогр.: 11 назв. — англ.

In [10], the notion of the splitting graph of a graph was introduced. In this paper we compute the zero forcing number of the splitting graph of a graph and also obtain some bounds besides finding the exact value of this parameter. We prove for any connected graph Г of order n ≥ 2, Z[S(Г)] ≤ 2Z(Г) a...