On the Power Domination Problem in Graphs

Simple item page
dc.contributor.advisorFerrero, Daniela
dc.contributor.authorBarrera, Roberto
dc.date.accessioned2009-06-04T18:50:20Z
dc.date.available2012-02-24T10:09:37Z
dc.date.issued2009-05
dc.description.abstractA crucial task for electric power companies consists of the continuous monitoring of their power network. This monitoring can be efficiently accomplished by placing phase measurement units (PMUs) at selected network locations. However, due to the high cost of the PMUs, their number must be minimized [1]. Finding the minimum number of PMUs needed to monitor a given power network, as well as to determine the locations where the PMUs should be placed, give rise to the power domination problem in graph theory [8]. The power dominating problem is NP-complete, that is, there is no efficient way of finding a minimal power dominating set for a graph. However, closed formulas for the power domination number of certain families of graphs, such as rectangular grids [5] have been found.
dc.description.departmentHonors College
dc.formatText
dc.format.extent40 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationBarrera, R. (2009). On the power domination problem in graphs (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/3170
dc.language.isoen
dc.subjectpower domination
dc.subjectgraph theory
dc.subjectdomination
dc.subjectgrid
dc.subjectcylinder
dc.subjecttorus
dc.subjectgeneralized Petersen graphs
dc.subjectHonors College
dc.titleOn the Power Domination Problem in Graphs
thesis.degree.departmentHonors College
thesis.degree.disciplineMathematics
thesis.degree.grantorTexas State University-San Marcos
txstate.documenttypeHonors Thesis

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
fulltext.pdf
Size:
259.69 KB
Format:
Adobe Portable Document Format
Download

Collections

Honors College Capstones