Some properties of graph tiling b-variant / (Record no. 32855)

MARC details
000 -LEADER
fixed length control field 02125nam a2200301 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260804151256.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 I121s 2026
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Ibañez, Jenky P.,
Relator term author.
245 10 - TITLE STATEMENT
Title Some properties of graph tiling b-variant /
Statement of responsibility, etc. Jenky P. Ibañez, Mylen C. Junio, and Arabella Mae M. Lontayao.
300 ## - PHYSICAL DESCRIPTION
Extent 72 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 paper introduces and examines a graph derived from the square tiling graph Gn,m, referred to as the graph tiling b-variant and denoted by (Gn,m) ∗∗. This variant is obtained by subdividing each edge of the square tiling graph Gn,m exactly once. Let S denote the set of vertices resulting from these subdivisions. The vertex set of the graph tiling b-variant is defined by V((Gn,m) ∗∗) = V(Gn,m) ∪ S. Two vertices a, b ∈ V((Gn,m) ∗∗) are adjacent if they satisfy one of the following conditions: (i) a, b ∈ S and they subdivide adjacent edges within a common C4 in Gn,m; or (ii) a ∈ V(Gn,m) and b ∈ S, where a is incident to the edge subdivided by b. This study examines the fundamental properties of (Gn,m) ∗∗, including its order, size, and bounds on vertex degrees. Additionally, we determine several graph parameters of the graph tiling b-variant, specifically the clique number, chromatic number, chromatic index, independence number, and the minimum vertex cover number.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Junio, Mylen C.,
Relator term author.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Lontayao, Arabella Mae M.,
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 Alib, Clarence T.,
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 I121s
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 I121s 2026 007406UM 08/04/2026 1-1 08/04/2026 Unpublished Materials