MARC details
000 -LEADER |
fixed length control field |
02367nam a22003373a 4500 |
001 - CONTROL NUMBER |
control field |
UPMIN-00004810105 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
UPMIN |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20221123131807.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
221123b |||||||| |||| 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 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
LG993.5 2010 |
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
A64 A76 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Aro, Kristine Joy P. |
245 ## - TITLE STATEMENT |
Title |
Minimum dominating set of P4 x Cm, M_>3 / |
Statement of responsibility, etc. |
Kristine Joy P. Aro |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Date of publication, distribution, etc. |
2010 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
52 leaves. |
500 ## - GENERAL NOTE |
General note |
College of Science and Mathematics |
502 ## - DISSERTATION NOTE |
Dissertation note |
Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2010 |
520 3# - SUMMARY, ETC. |
Summary, etc. |
In computer science and mathematics, we use diagrams in order to solve problems. Let G= (V, E) be an undirected graph, where V is the set of vertices in G and E is the set of edges in G. A dominating set S of a graph G is a subset of the set of vertices V such every vertex in V is adjacent to at least one vertex in S. the subset with the least number of elements is called the minimum dominating set. This study with the least number of elements is called the minimum dominating set. This study could be used in solving problems such as the computation of wireless network problems, reconstructing the evolutionary history of biological species, resource allocation and many more. In resource allocation, it helps a lot to minimize the operational costs while in communication networks, it helps provide reliable services. The objective of the study is to find the minimum dominating set of graphs P4 x Cm by partitioning of graph P4 x Cm into subgraphs P4 x P2 or P4 x P3. However, by partition of graph into subgraph, it came up a formula that could be easily used to find the minimum dominating set of graphs P4 x Cm, m≥ 3. If m is even, express two or more P4 x P2, then a domination number of graph P4 x Cm is m. If m is odd, express one (P4 x P3) and two or more (P4 x P2), then a domination number of graph P4 x Cm is m+1 if m is 3, 5, 9 and m ε Z+ While if m is 7, m ≥11 and m ε Z+, then the domination number of P4 x Cm is m |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Cycle |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Minimumdominating set |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
NP-complete |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Partition |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Path |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Product graph |
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
subgraphs |
658 ## - INDEX TERM--CURRICULUM OBJECTIVE |
Main curriculum objective |
Undergraduate Thesis |
Curriculum code |
AMAT200 |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
a |
UP |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
a |
Fi |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Library of Congress Classification |
Koha item type |
Thesis |