Normal view MARC view ISBD view

On properties of kp-restricted intersection graph / Hannah I. Estrada, Camille R. Navarro, and John Earl M. Sopeña.

By:

Estrada, Hannah I [author.]

Contributor(s):

Material type: Text

TextDescription: 70 leavesContent type:

text

Media type:

unmediated

Carrier type:

volume

Dissertation note: Undergraduate Thesis (BSAM)- Applied Mathematics. Camarines Sur Polytechnic Colleges, 2026. Abstract: The graphs in this study involve the concepts of sets and intersections and are classified as simple and regular graphs. This study introduces a new class of the k-restricted intersection graphs and discusses its fundamental properties which includes order, size, vertex degree, and special cases. Let Sn be a set of n elements, and let S(n, k) be the collection of all k-element subsets of Sn. The kp-restricted intersection graph, denoted by G p S(n,k) , is defined on S(n,k) such that two vertices are adjacent whenever their intersection contains exactly p elements. Formulas for the order, size and vertex degree were derived. Special cases under specific values of n, k, and p are also presented. The study also determines the possible values of p for certain values of k. There are specific conditions of kp-restricted intersection graphs that guarantees the resulting graph is complete. Other special cases produce empty graph. Moreover, the union of a certain kp-restricted intersection graphs was shown to be isomorphic to a complete graph.

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 E821o 2026 (Browse shelf(Opens below))	1-1	Not for loan		007403UM

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 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 /	UTH BSAM N441f 2026 Fold thickness of non-traceable cubic bridge graph /	Next

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

Includes bibliographical references.

The graphs in this study involve the concepts of sets and intersections and are classified as simple and regular graphs. This study introduces a new class of the k-restricted intersection graphs and discusses its fundamental properties which includes order, size, vertex degree, and special cases. Let Sn be a set of n elements, and let S(n, k) be the collection of all k-element subsets of Sn. The kp-restricted intersection graph, denoted by G p S(n,k) , is defined on S(n,k) such that two vertices are adjacent whenever their intersection contains exactly p elements. Formulas for the order, size and vertex degree were derived. Special cases under specific values of n, k, and p are also presented. The study also determines the possible values of p for certain values of k. There are specific conditions of kp-restricted intersection graphs that guarantees the resulting graph is complete. Other special cases produce empty graph. Moreover, the union of a certain kp-restricted intersection graphs was shown to be isomorphic to a complete graph.

There are no comments on this title.

to post a comment.