Power edge set of graphs

The power edge set problem is a variant of the power domination problem which is very useful in the study of power networks. The least number of phase measurement units (PMUs) that have to be placed on the edges in order to monitor a graph G is called the power edge set number pmu(G) and the corresp...

Full description

Saved in:
Bibliographic Details
Main Authors: Prabha, R., Thenmozhi, B.
Format: Conference Proceeding
Language:English
Subjects:
Graph theory
Graphs
Phase measurement
Units of measurement
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The power edge set problem is a variant of the power domination problem which is very useful in the study of power networks. The least number of phase measurement units (PMUs) that have to be placed on the edges in order to monitor a graph G is called the power edge set number pmu(G) and the corresponding problem is called power edge set problem. In this article, we characterize those graphs for which pmu(G)=1 and also compute the power edge set number of Generalised Petersen graphs and Circulant graphs.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0110131