On the zero forcing number of graphs and their splitting graphs

dc.contributor.author	Chacko, B.
dc.contributor.author	Dominic, C.
dc.contributor.author	Premodkumar, K. P.
dc.date.accessioned	2019-12-02T10:11:38Z
dc.date.available	2019-12-02T10:11:38Z
dc.date.issued	2019
dc.identifier.uri	http://hdl.handle.net/123456789/4362
dc.description	Chacko B. On the zero forcing number of graphs and their splitting graphs / B. Chacko, Ch. Dominic, K. P. Premodkumar // Algebra and Discrete Mathematics. - 2019. - Vol. 28. - Number 1. - Рp.29-43	uk_UA
dc.description.abstract	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(􀀀)] 6 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(􀀀).	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	ДЗ "ЛНУ імені Тараса Шевченка"	uk_UA
dc.subject	zero forcing number	uk_UA
dc.subject	splitting graph	uk_UA
dc.subject	path cover number and domination number of a graph	uk_UA
dc.title	On the zero forcing number of graphs and their splitting graphs	uk_UA
dc.type	Article	uk_UA