000			02165nam a2200301 i 4500
003			CSPC
005			20260804142704.0
008			260804s2026 ph a b 000 0 eng d
040			_aCSPC _beng _cCSPC _erda
090			_aUTH BSAM E821o 2026
100	1		_aEstrada, Hannah I., _eauthor.
245	1	0	_aOn properties of kp-restricted intersection graph / _cHannah I. Estrada, Camille R. Navarro, and John Earl M. Sopeña.
300			_a70 leaves.
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
502			_aUndergraduate Thesis (BSAM)- Applied Mathematics. _cCamarines Sur Polytechnic Colleges, 2026.
504			_aIncludes bibliographical references.
520	3		_aThe 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.
700	1		_aNavarro, Camille R., _eauthor.
700	1		_aSopeña, John Earl M., _eauthor.
720			_aNieva, Alex Ralph B., _eadviser.
720			_aJagmis, Jiel Mark D., _echair, panelist.
720			_aMagtibay, Francis Gerard C., _epanelist.
720			_aDacillo, Garry P., _epanelist.
942			_2ddc _n0 _cUM _hE821o _iBSAM _kUTH _m2026
999			_c32852 _d32852