Fold thickness of non-traceable cubic bridge graph / (Record no. 32857)

MARC details
000 -LEADER
fixed length control field 02254nam a2200301 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260804152850.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 N441f 2026
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Nepomuceno, Cielo E.,
Relator term author.
245 10 - TITLE STATEMENT
Title Fold thickness of non-traceable cubic bridge graph /
Statement of responsibility, etc. Cielo E. Nepomuceno, Crystal Jean T. Putian, and Mark Errol T. Red.
300 ## - PHYSICAL DESCRIPTION
Extent 122 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 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# - ADDED ENTRY--PERSONAL NAME
Personal name Putian, Crystal Jean T.,
Relator term author.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Red, Mark Errol T.,
Relator term author.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Magtibay, Francis Gerard C.,
Relator term adviser.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Jagmis, Jiel Mark D.,
Relator term chair, panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Nieva, Alex Ralph B.,
Relator term panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Nocum, Karen P.,
Relator term external 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 N441f
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 N441f 2026 007408UM 08/04/2026 1-1 08/04/2026 Unpublished Materials