02116nam a2200301 i 4500003000500000005001700005008004100022040002500063090002400088100003300112245012300145300001500268336002100283337002500304338002300329502009700352504004100449520090900490700003701399700003801436720003601474720005101510720003701561720003501598942003901633952012501672999001701797CSPC20260804143545.0260804s2026    ph a     b    000 0 eng d  aCSPCbengcCSPCerda  aUTH BSAM B827j 20261 aBrazal, Maricel O.,eauthor.40aThe j-edge intersection graph of hairy cycle / cMaricel O. Brazal, Louise Geil L. Ortega, and Denise Lynne D. Salona.  a59 leaves.  2rdacontentatext  2rdamediaaunmediated  2rdacarrieravolume  aUndergraduate Thesis (BSAM)- Applied Mathematics.cCamarines Sur Polytechnic Colleges, 2026.  aIncludes bibliographical references.3 aThis 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.1 aOrtega, Louise Geil L.,eauthor.1 aSalona, Denise Lynne D.,eauthor.  aJagmis, Jiel Mark D.,eadviser.  aMagtibay, Francis Gerard C.,echair, panelist.  aNieva, Alex Ralph B.,epanelist.  aTorino, Jovanie G.,epanelist.  2ddcn0cUMhB827jiBSAMkUTHm2026  00102ddc4070aCSPCbCSPCcUTHd2026-08-04l0oUTH BSAM B827j 2026p007404UMr2026-08-04 14:35:59t1-1w2026-08-04yUM  c32853d32853