000			02147nam a2200301 i 4500
003			CSPC
005			20260804145646.0
008			260804s2026 ph a b 000 0 eng d
040			_aCSPC _beng _cCSPC _erda
090			_aUTH BSAM A743z 2026
100	1		_aArnante, Decemae Joy A., _eauthor.
245	1	0	_aZero forcing 2-hop domination of graphs / _cDecemae Joy A. Arnante, Angelica D. Mora, and Mary Joy A. Ramboyong.
300			_a71 leaves.
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
502			_aUndergraduate Thesis (BSAM)- Applied Mathematics. _cCamarines Sur Polytechnic Colleges, 2026.
504			_aIncludes bibliographical references.
520	3		_aThis study investigates zero forcing 2-hop domination in graphs, a graph param- eter that integrates the propagation mechanics of zero forcing with the coverage requirements of 2-hop domination. A set Z ⊆ V(G) is a zero forcing 2-hop dominat- ing set of a graph G if Z is both a zero forcing set and a 2-hop dominating set. The zero forcing 2-hop domination number is the minimum cardinality of Z, denoted by γz2h(G). This paper formally establishes results on the zero forcing 2-hop domi- nation numbers of various classes of graphs, including paths Pn (n ≥ 5) and cycles Cn (n ≥ 5), where both values are determined by n (mod 4). Moreover, the zero forcing 2-hop domination numbers on complete graphs Kn (n ≥ 5), complete bipar- tite graphs Km,n (m, n ≥ 3), and wheel graphs Wn (n ≥ 6) are also established. The results of γz2h(G) are similar to parameters like zero forcing hop domination. Fur- thermore, conjecture on the zero forcing 2-hop domination number of the tadpole graph, where n ≥ 3, is presented.
700	1		_aMora, Angelica D., _eauthor.
700	1		_aRamboyong, Mary Joy A., _eauthor.
720			_aJagmis, Jiel Mark D., _eadviser.
720			_aNieva, Alex Ralph B., _echair, panelist.
720			_aMagtibay, Francis Gerard C., _epanelist.
720			_aRacca, Abraham P., _epanelist.
942			_2ddc _n0 _cUM _hA743z _iBSAM _kUTH _m2026
999			_c32854 _d32854