Zero forcing 2-hop domination of graphs / (Record no. 32854)

MARC details
000 -LEADER
fixed length control field 02147nam a2200301 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260804145646.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 260804s2026 ph a b 000 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency CSPC
Language of cataloging eng
Transcribing agency CSPC
Description conventions rda
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) UTH BSAM A743z 2026
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Arnante, Decemae Joy A.,
Relator term author.
245 10 - TITLE STATEMENT
Title Zero forcing 2-hop domination of graphs /
Statement of responsibility, etc. Decemae Joy A. Arnante, Angelica D. Mora, and Mary Joy A. Ramboyong.
300 ## - PHYSICAL DESCRIPTION
Extent 71 leaves.
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
502 ## - DISSERTATION NOTE
Dissertation note Undergraduate Thesis (BSAM)- Applied Mathematics.
Name of granting institution Camarines Sur Polytechnic Colleges, 2026.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references.
520 3# - SUMMARY, ETC.
Summary, etc. This 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# - ADDED ENTRY--PERSONAL NAME
Personal name Mora, Angelica D.,
Relator term author.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ramboyong, Mary Joy A.,
Relator term author.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Jagmis, Jiel Mark D.,
Relator term adviser.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Nieva, Alex Ralph B.,
Relator term chair, panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Magtibay, Francis Gerard C.,
Relator term panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Racca, Abraham P.,
Relator term panelist.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Suppress in OPAC No
Koha item type Unpublished Materials
Classification part A743z
Item part BSAM
Call number prefix UTH
Call number suffix 2026
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Dewey Decimal Classification     Main Library Main Library Undergraduate Thesis Section 08/04/2026   UTH BSAM A743z 2026 007405UM 08/04/2026 1-1 08/04/2026 Unpublished Materials