MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02025nam a2200301 i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CSPC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20260804143545.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 B827j 2026 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Brazal, Maricel O., |
| Relator term |
author. |
| 245 40 - TITLE STATEMENT |
|---|
| Title |
The j-edge intersection graph of hairy cycle / |
| Statement of responsibility, etc. |
Maricel O. Brazal, Louise Geil L. Ortega, and Denise Lynne D. Salona. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
59 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 explores the j-edge intersection graph as applied specifically to the hairy cycle, denoted by EH(k,j) . Graph EH(k,j) is a graph whose vertex set consists of the spanning subgraphs of a hairy cycle Hk with j edges, where k ≥ 3 and j is a non- negative integer such that 1 ≤ j ≤ 2k. Two vertices are adjacent if their respective spanning subgraphs share exactly one common edge. Graph EH(k,j) is considered a simple graph, containing neither loops nor multiple edges. When j = 0 or j > 2k, the graph EH(k,j) cannot be constructed, whereas when j = 1, it produces an empty graph. It can also be a trivial graph if and only if j = 2k. Furthermore, this paper determines fundamental parameters of this graph, such as order, degree, and size, that can contribute to a deeper understanding of the j-edge intersection graph of hairy cycles and extend existing work in intersection graphs. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Ortega, Louise Geil L., |
| Relator term |
author. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Salona, Denise Lynne D., |
| Relator term |
author. |
| 720 ## - ADDED ENTRY--UNCONTROLLED NAME |
|---|
| Name |
Jagmis, Jiel Mark D., |
| Relator term |
adviser. |
| 720 ## - ADDED ENTRY--UNCONTROLLED NAME |
|---|
| Name |
Magtibay, Francis Gerard C., |
| Relator term |
chair, panelist. |
| 720 ## - ADDED ENTRY--UNCONTROLLED NAME |
|---|
| Name |
Nieva, Alex Ralph B., |
| Relator term |
panelist. |
| 720 ## - ADDED ENTRY--UNCONTROLLED NAME |
|---|
| Name |
Torino, Jovanie G., |
| Relator term |
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 |
B827j |
| Item part |
BSAM |
| Call number prefix |
UTH |
| Call number suffix |
2026 |