Normal view MARC view ISBD view

The j-edge intersection graph of hairy cycle / Maricel O. Brazal, Louise Geil L. Ortega, and Denise Lynne D. Salona.

By:

Brazal, Maricel O [author.]

Contributor(s):

Material type: Text

TextDescription: 59 leavesContent type:

text

Media type:

unmediated

Carrier type:

volume

Dissertation note: Undergraduate Thesis (BSAM)- Applied Mathematics. Camarines Sur Polytechnic Colleges, 2026. Abstract: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Shelving location	Call number	Copy number	Status	Date due	Barcode
Unpublished Materials	Main Library	Undergraduate Thesis Section	UTH BSAM B827j 2026 (Browse shelf(Opens below))	1-1	Not for loan		007404UM

Browsing Main Library shelves, Shelving location: Undergraduate Thesis Section Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	UTH BPED R279p 2024 Physical education courses: Its effectiveness on holistic health /	UTH BS OA B644c 2017 Challenges encountered in searching for employment of bachelor of elementary education and electronics communication and service technology graduates of Camarines Sur Polytechnic Colleges, Buhi extension campus/	UTH BSAM A743z 2026 Zero forcing 2-hop domination of graphs /	UTH BSAM B827j 2026 The j-edge intersection graph of hairy cycle /	UTH BSAM E821o 2026 On properties of kp-restricted intersection graph /	UTH BSAM I121s 2026 Some properties of graph tiling b-variant /	UTH BSAM L961f 2026 Fold thickness of middle graph of some trees /	Next

Undergraduate Thesis (BSAM)- Applied Mathematics. Camarines Sur Polytechnic Colleges, 2026.

Includes bibliographical references.

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.

There are no comments on this title.

to post a comment.