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

Simple item page
dc.contributor.authorAleeha Shahid
dc.contributor.authorCIIT/SP20-RMT-020/LHR
dc.contributor.authorDr. Hafiz Muhammad Afzal Siddiqui
dc.contributor.authorLHR TP 7651
dc.date.accessioned2026-05-05T15:51:02Z
dc.date.issued2021
dc.description.abstractThis 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.
dc.identifier.urihttps://repository.cuilahore.edu.pk/123456789/3865
dc.language.isoen
dc.publisherLibrary Information Services, COMSATS University Islamabad, Lahore Campus
dc.relation.ispartofseriesLHR TP 7651
dc.subjectDepartment of Mathematics
dc.subjectSP20
dc.subjectMathematics
dc.subjectZero Forcing Number
dc.subjectF-Sum of Graphs
dc.subjectGraph Theory
dc.subjectGraph Invariants
dc.subjectDr. Hafiz Muhammad Afzal Siddiqui
dc.titleZero Forcing Number of F-Sum of Some Families of Graphs
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Aleeha final thesis complete.pdf
Size:
1.92 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
319 B
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

M.Phil / MS