Zero Forcing Number Of F- Sum Of Some Families Of Graphs

Shahid, Aleeha

dc.contributor.author	Shahid, Aleeha
dc.date.accessioned	2022-08-19T08:42:01Z
dc.date.available	2022-08-19T08:42:01Z
dc.date.issued	2022-08-19
dc.identifier.uri	http://repository.cuilahore.edu.pk/xmlui/handle/123456789/3364
dc.description.abstract	This thesis deals with zero forcing number of 𝐹-sum of graphs derived from certain families of graph. A zero forcing set of graph 𝑆 is a set 𝑆 ⊆ 𝑉 such that there are no white vertices in the derived coloring of 𝑆. The zero forcing number of 𝐺 is 𝑍(𝐺) = min {\|𝑆\|: 𝑆 is zero forcing set of 𝐺}. We study zero forcing number of 𝐹-sum of two path graph, two cycle graph and then path and cycle graph. It has been proved that it is constant in case of 𝑆 operation of 𝐹-sum and unbounded otherwise	en_US
dc.publisher	Mathematics COMSATS University Islamabad Lahore Campus	en_US
dc.relation.ispartofseries	SP20-RMT -020;7651
dc.subject	zero forcing number of 𝐹-sum of graphs derived from certain families of graph	en_US
dc.title	Zero Forcing Number Of F- Sum Of Some Families Of Graphs	en_US
dc.type	Thesis	en_US