Computation of minimum dominating set for the graph C3 x Cm / (Record no. 451)

MARC details
000 -LEADER
fixed length control field 01903nam a2200241 4500
001 - CONTROL NUMBER
control field UPMIN-00000010148
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20230213115018.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230213b |||||||| |||| 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 2004
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) A64 V55
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Villano, Julius B.
9 (RLIN) 2435
245 00 - TITLE STATEMENT
Title Computation of minimum dominating set for the graph C3 x Cm /
Statement of responsibility, etc. Julius B. Villano
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2004
300 ## - PHYSICAL DESCRIPTION
Extent 71 leaves
502 ## - DISSERTATION NOTE
Dissertation note Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2004
520 3# - SUMMARY, ETC.
Summary, etc. 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 that 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 is concerned about the computation of minimum dominating set of the product graph of two cycles, C3 x Cm. Several motivations for studying minimum dominating set of the graph C3 x Cm arises from wireless communication networks and resource allocation in distributed systems. However, this study can be applied only if the geographical properties of the data are somewhat similar to the graph of C3 x Cm. It reduces routing and searching process, minimizes operational costs, but at the same time provides convenience to consumers or subscribers. Using the properties of finite state spaces and backward dynamic programming and with the aid of a computer program, the final states that produces a minimum dominating set with the minimum cardinality y(G) for j 12 are identified. Furthermore, an algorithm is formulated for computation of minimum dominating set of C3 x Cm.
658 ## - INDEX TERM--CURRICULUM OBJECTIVE
Main curriculum objective Undergraduate Thesis
Curriculum code AMAT200,
Source of term or code BSAM
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
Holdings
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 Price effective from Koha item type
    Library of Congress Classification   Not For Loan Preservation Copy University Library University Library Archives and Records 2005-03-22 donation UAR-T-gd515   LG993.5 2004 A64 V55 3UPML00021483 2022-09-21 2022-09-21 Thesis
    Library of Congress Classification   Not For Loan Room-Use Only College of Science and Mathematics University Library Theses 2005-03-01 donation CSM-T-gd1207   LG993.5 2004 A64 V55 3UPML00011306 2022-09-21 2022-09-21 Thesis
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved