Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
On the zero forcing number of graphs and their splitting graphs
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
On the zero forcing number of graphs and their splitting graphs
Інший ID:
2010 MSC: 05C50.
Посилання:
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 назв. — англ.
Підтримка:
We are very indebted to an anonymous referee for all of his/her corrections and suggestions which have improved this article a lot.
Дата:
2019
Переглядів:
163
Завантажень:
59
Анотація:
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(Г) and also obtain many classes of graph in which Z[S(Г)] = 2Z(Г). Further, we show some classes of graphs in which Z[S(Г)] < 2Z(Г).
