On properties of kp-restricted intersection graph / (Record no. 32852)

MARC details
000 -LEADER
fixed length control field 02165nam a2200301 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260804142704.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 E821o 2026
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Estrada, Hannah I.,
Relator term author.
245 10 - TITLE STATEMENT
Title On properties of kp-restricted intersection graph /
Statement of responsibility, etc. Hannah I. Estrada, Camille R. Navarro, and John Earl M. Sopeña.
300 ## - PHYSICAL DESCRIPTION
Extent 70 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. 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.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Navarro, Camille R.,
Relator term author.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Sopeña, John Earl M.,
Relator term author.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Nieva, Alex Ralph B.,
Relator term adviser.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Jagmis, Jiel Mark D.,
Relator term chair, panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Magtibay, Francis Gerard C.,
Relator term panelist.
720 ## - ADDED ENTRY--UNCONTROLLED NAME
Name Dacillo, Garry P.,
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 E821o
Item part BSAM
Call number prefix UTH
Call number suffix 2026
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Dewey Decimal Classification     Main Library Main Library Undergraduate Thesis Section 08/04/2026   UTH BSAM E821o 2026 007403UM 08/04/2026 1-1 08/04/2026 Unpublished Materials