Some generator subgraphs of square tilings / (Record no. 32856)

MARC details
000 -LEADER
fixed length control field 02485nam a2200277 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260804152034.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 R935s 2026
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Rull, Rodly Angelo S.,
Relator term author.
245 10 - TITLE STATEMENT
Title Some generator subgraphs of square tilings /
Statement of responsibility, etc. Rodly Angelo S. Rull.
300 ## - PHYSICAL DESCRIPTION
Extent 113 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. Analyzing the structure of graphs sometimes involves identifying specific sub- graphs that disclose important properties of the graph. One such concept is gen- erator subgraphs, which examine how certain subgraphs are capable of generat- ing the edges on a given graph. Necessary conditions are established for these square tilings to serve as generator subgraphs. All graphs considered in this pa- per are finite simple undirected graphs. Let H be a subgraph of G. Then the set EH(G) = {A ∈ E (G)|G[A] H} denotes the uniform set of H with respect to G while E (G) denotes the subspace of the edge space E (G) generated by EH(G), we adopt the symbol EH(G). The subgraph H of G is a generator subgraph if and only if, EH(G)is a generating set, that is EH(G) = E (G), then H is called a generator subgraph of G. The researcher established that the dimension of edge space of a square tiling is dim(E (□n×m)) = 2nm +n+ m, the cardinality of the uniform set of P4 with respect to □n×m is |EP4 (□n×m)| = 16nm − 6n − 6m. Moreover, this paper provides necessary and sufficient conditions for paths and disjoint union of paths to be generator subgraphs of square tilings. Specifically, this paper provides characterization for star, tadpole graph and hairy cycle, so that these classes of graphs are generator subgraphs of square tilings. The findings of this study contribute to a deeper understanding of a graph structure and its potential applications in various fields of graph theory.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Magtibay, Francis Gerard C.,
Relator term adviser.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Nieva, Alex Ralph B.,
Relator term chair, panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Jagmis, Jiel Mark D.,
Relator term panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Torino, Jovanie G.,
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 R935s
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 R935s 2026 007407UM 08/04/2026 1-1 08/04/2026 Unpublished Materials