Fold thickness of middle graph of some trees / (Record no. 32858)

MARC details
000 -LEADER
fixed length control field 02045nam a2200277 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260804163119.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 L961f 2026
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Luna, Paul David N.,
Relator term author.
245 10 - TITLE STATEMENT
Title Fold thickness of middle graph of some trees /
Statement of responsibility, etc. Paul David N. Luna.
300 ## - PHYSICAL DESCRIPTION
Extent 140 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. The largest number of sequence of foldings that preserves the singularity or non-singularity of a graph G is called the fold thickness of G, denoted by fold(G). This paper investigated the fold thickness of the middle graph of some classes of trees. We show that the middle graph of any tree is singular. Based on this foundational property, the fold thickness for the middle graphs of a path Pn, a star Sk , and the corona product Pn⊙K1 is obtained. For the middle graph of a path,M(Pn) where n ≥ 2, folding pendant vertices yields non-singular graphs, whereas folding specific subdivision vertices preserves singularity, leading to fold(M(Pn)) = 0 for n < 4 and fold(M(Pn)) = 2n − 5 for n ≥ 4. For the middle graph of a star, M(Sk), any 1-fold results in a non-singular graph isomorphic to M(Sk) − v1, implying that fold(M(Sk)) = 0. Finally, for the middle graph of Pn ⊙ K1 where n ≥ 3, a uniform folding sequence can be done by folding subdivision vertices from consecutive pendant edges, yielding a fold thickness of fold(M(Pn ⊙ K1)) = 4n − 6.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Nieva, Alex Ralph B.,
Relator term adviser.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Jagmis, Jiel Mark D.,
Relator term chair, panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Magtibay, Francis Gerard C.,
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 L961f
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 L961f 2026 007409UM 08/04/2026 1-1 08/04/2026 Unpublished Materials