Power domination on permutation graphs

Simple item page
dc.contributor.advisorFerrero, Daniela
dc.contributor.authorWilson, Samuel N.
dc.date.accessioned2020-10-23T13:55:36Z
dc.date.available2020-10-23T13:55:36Z
dc.date.issued2013-05
dc.description.abstractFor the purposes of monitoring power networks, power companies use devices known as phase measurement units (PMUs); these monitor the waveform of the various nodes in a network. The cost of these units makes it worthwhile to minimize the number required. When a power network is modeled by a graph, the question of precisely how many are necessary to observe a given network, and of where they should be placed, is known as the power domination problem. We will consider this problem as it relates to permutation graphs on cycles, and suggest upper bounds for the power domination numbers on such graphs.
dc.description.departmentMathematics
dc.formatText
dc.format.extent42 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationWilson, S. N. (2013). Power domination on permutation graphs (Unpublished thesis). Texas State University-San Marcos, San Marcos, Texas.
dc.identifier.urihttps://hdl.handle.net/10877/12824
dc.language.isoen
dc.subjectdomination
dc.subjectgraph theory
dc.subjectpermutations
dc.titlePower domination on permutation graphs
dc.typeThesis
thesis.degree.departmentMathematics
thesis.degree.grantorTexas State University-San Marcos
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

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

Collections

Graduate Theses and Dissertations