Minimum dominating set of (P3 x Cm) a product of path of length 2 and a cycle of length m / Junie L. Bao
Material type:
TextPublication details: 2003Description: 53 leavesSubject(s): Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 20103 Abstract: A set vertices of a graphs is called dominating set if every other vertex is adjacent to at least one vertex of the set. It is found out that it has an application in transmitting messages in wireless communication links and in resource allocation in distributed system, in resource allocation, it helps a lot to minimize the operational costs while in communication networks, it helps provide reliable services. The main concern of this study is to find the minimum dominating set of the product graph of path P3 and a cycle of length m, for all m ≥ 3 by using dynamic programming. Using the approach in dynamic programming, an 11x11 cost matrix is produced through a computer program. From this cost matrix, a periodic behavior is observed to generate the state sequences. These state sequences produce the minimum dominating set of P3 x Cm.
| Cover image | Item type | Current library | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
|
|
Thesis
|
University Library General Reference | Room-Use Only | LG993.5 2003 A64 B36 (Browse shelf(Opens below)) | Not For Loan | 3UPML00010405 | |
|
|
Thesis
|
University Library Archives and Records | Preservation Copy | LG993.5 2003 A64 B36 (Browse shelf(Opens below)) | Not For Loan | 3UPML00020969 |
Browsing University Library shelves, Shelving location: Archives and Records, Collection: Preservation Copy Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||
| LG993.5 2002 E7 M358 Trapped / | LG993.5 2003 A64 A43 A reevaluation of population and nesting density estimates of the Philippine eagle pithecophaga jefferyl in Mindanao using Voronoi diagram / | LG993.5 2003 A64 A92 Stochastic modeling of Talomo River flow / | LG993.5 2003 A64 B36 Minimum dominating set of (P3 x Cm) a product of path of length 2 and a cycle of length m / | LG993.5 2003 A64 B65 A mathematical model for the selection of outstanding teacher in UP-Mindanao / | LG993.5 2003 A64 C83 Minimum dominating set of graph P2 X Cm / | LG993.5 2003 A64 D45 Measurement of the area of the sago palm (metroxylon sagu, Rottb.) / |
Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 20103
A set vertices of a graphs is called dominating set if every other vertex is adjacent to at least one vertex of the set. It is found out that it has an application in transmitting messages in wireless communication links and in resource allocation in distributed system, in resource allocation, it helps a lot to minimize the operational costs while in communication networks, it helps provide reliable services. The main concern of this study is to find the minimum dominating set of the product graph of path P3 and a cycle of length m, for all m ≥ 3 by using dynamic programming. Using the approach in dynamic programming, an 11x11 cost matrix is produced through a computer program. From this cost matrix, a periodic behavior is observed to generate the state sequences. These state sequences produce the minimum dominating set of P3 x Cm.
Click on an image to view it in the image viewer
There are no comments on this title.