Minimum dominating set of graph P2 X Cm / (Record no. 153)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01777nam a2200241 4500 |
| 001 - CONTROL NUMBER | |
| control field | UPMIN-00000009074 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UPMIN |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20221205162819.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 221205b |||||||| |||| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | DLC |
| Transcribing agency | UPMin |
| Modifying agency | upmin |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) | |
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) | LG993.5 2003 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) | A64 C83 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Cubio, Kristine Marie S. |
| 9 (RLIN) | 391 |
| 245 00 - TITLE STATEMENT | |
| Title | Minimum dominating set of graph P2 X Cm / |
| Statement of responsibility, etc. | Kristine Marie S. Cubio |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Date of publication, distribution, etc. | 2003 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 57 leaves |
| 502 ## - DISSERTATION NOTE | |
| Dissertation note | Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2003 |
| 520 3# - SUMMARY, ETC. | |
| Summary, etc. | A set of vertices of a graph G=(V,E) is a dominating set if all the vertices/nodes in the graph are either in the set or neighbors of the vertices/nodes in the set. The main concern of this study is to an efficient algorithm for determining the minimum dominating set of the product graph of a path of order 2 and a cycle of length m ≥ 3 (P2 x Cm). The minimum dominating set of the graph P2 x Cm for all the values of m can be easily identified by enumerating all the possible states sequence. But for large values of m, it is tedious to enumerate all the possible states sequence. Using the approach of dynamic programming, a solution is produced with much less effort than exhaustive enumeration. A computer program is written to determine the sequence of states and its corresponding weight. Thus a cost matrix is obtained using the approach of dynamic programming wherein the elements of Cm(i, j) in row I and column j contain the quantities c(i, j) and f(i, j). from the cost matrix, the state sequence for any m is now obtainable. Thus, a minimum dominating set of P2 x Cm can be provided. |
| 658 ## - INDEX TERM--CURRICULUM OBJECTIVE | |
| Main curriculum objective | Undergraduate Thesis |
| Curriculum code | AMAT200 |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
| a | Fi |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
| a | UP |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Koha item type | Thesis |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Status | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Accession Number | Total Checkouts | Full call number | Barcode | Date last seen | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Library of Congress Classification | Not For Loan | Preservation Copy | University Library | University Library | Archives and Records | 2003-06-05 | donation | UAR-T-gd265 | LG993.5 2003 A64 C83 | 3UPML00020901 | 2022-09-21 | Thesis | ||||
| Library of Congress Classification | Not For Loan | Room-Use Only | College of Science and Mathematics | University Library | Theses | 2003-05-21 | donation | CSM-T-gd514 | LG993.5 2003 A64 C83 | 3UPML00010398 | 2022-09-21 | Thesis |