Power domination on permutation graphs

We consider the problem of power domination as applied to permutation graphs on cycles, regarding the minimum number of phase measurement units needed to observe such a graph. We calculate this number for certain sizes of such graphs, and provide support for a conjecture regarding graphs of arbitrar...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2019-06, Vol.262, p.169-178
Main Author: Wilson, S.
Format: Article
Language:English
Subjects:
Dominating sets
Graph theory
Graphs
Network observation
Permutations
Phase measurement
Power domination
Units of measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of power domination as applied to permutation graphs on cycles, regarding the minimum number of phase measurement units needed to observe such a graph. We calculate this number for certain sizes of such graphs, and provide support for a conjecture regarding graphs of arbitrary size.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2019.02.027