000 02254nam a2200301 i 4500
003 CSPC
005 20260804152850.0
008 260804s2026 ph a b 000 0 eng d
040 _aCSPC
_beng
_cCSPC
_erda
090 _aUTH BSAM N441f 2026
100 1 _aNepomuceno, Cielo E.,
_eauthor.
245 1 0 _aFold thickness of non-traceable cubic bridge graph /
_cCielo E. Nepomuceno, Crystal Jean T. Putian, and Mark Errol T. Red.
300 _a122 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 the fold thickness of specific classes of Non-Traceable Cubic Bridge Graphs (NTCBGs), a family previously unexplored in this context. A 1-fold of a graph G is defined by identifying two nonadjacent vertices with a common neighbor and simplifying multiple edges. A uniform k-folding is a sequence of such operations where every resulting graph maintains the same singularity status as G. The fold thickness is the maximum length of such a sequence. Building on the NTCBG constructions introduced by Nieva and Nocum (2022), we determine the fold thickness for central fragment trees (Tq), hairy cycles (Hn). Furthermore, we evaluate their extended forms (Tq,m, Hn,m), which are modified structures obtained by iteratively joining the null graph on two vertices K2 to the end-vertices of these central fragments. We also analyze constructed branches derived from K4 and K3,3. By applying graph folding techniques and analyzing adjacency matrix properties, we establish exact values for the fold thickness of these classes. These results provide new algebraic and structural characterizations for NTCBGs.
700 1 _aPutian, Crystal Jean T.,
_eauthor.
700 1 _aRed, Mark Errol T.,
_eauthor.
720 _aMagtibay, Francis Gerard C.,
_eadviser.
720 _aJagmis, Jiel Mark D.,
_echair, panelist.
720 _aNieva, Alex Ralph B.,
_epanelist.
720 _aNocum, Karen P.,
_eexternal panelist.
942 _2ddc
_n0
_cUM
_hN441f
_iBSAM
_kUTH
_m2026
999 _c32857
_d32857