On the zero forcing number of graphs and their splitting graphs

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/4362

Title:	On the zero forcing number of graphs and their splitting graphs
Authors:	Chacko, B. Dominic, C. Premodkumar, K. P.
Keywords:	zero forcing number splitting graph path cover number and domination number of a graph
Issue Date:	2019
Publisher:	ДЗ "ЛНУ імені Тараса Шевченка"
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(􀀀).
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
URI:	http://hdl.handle.net/123456789/4362
Appears in Collections:	Algebra and Discrete Mathematics. - № 1 (28). - 2019

Files in This Item:

File	Description	Size	Format
496-4413-1-PB.pdf		412.3 kB	Adobe PDF	View/Open

DSpace JSPUI