scholarly journals On the Power Domination Number of de Bruijn and Kautz Digraphs

Author(s):  
Cyriac Grigorious ◽  
Thomas Kalinowski ◽  
Sudeep Stephen
2010 ◽  
Vol 02 (02) ◽  
pp. 199-205 ◽  
Author(s):  
JYHMIN KUO

Let V and A denote the vertex and edge sets of a digraph G. A set T ⊆V is a twin dominating set of G if for every vertex v ∈ V - T, there exist u, w ∈ T (possibly u = w) such that arcs (u, v), (v, w) ∈ A. The twin domination number γ*(G) of G is the cardinality of a minimum twin dominating set of G. In this note, we investigate the twin domination numbers of generalized de Bruijn digraph and generalized Kautz digraph. The bounds of twin domination number of special generalized Kautz digraphs are given.


2015 ◽  
Vol 07 (01) ◽  
pp. 1550003 ◽  
Author(s):  
Jyhmin Kuo ◽  
Wei-Lun Wu

To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in graph theory. A set P is a power dominating set (PDS) of a graph G = (V, E), if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of a PDS of a graph G is the power domination number γp(G). In this paper, we determine the upper bounds of power domination number of generalized undirected de Bruijn graphs and generalized undirected Kautz graphs.


2020 ◽  
Author(s):  
T. N. Saibavani ◽  
N. Parvathi

2016 ◽  
Vol 12 (2) ◽  
pp. 339-357
Author(s):  
Yanxia Dong ◽  
Erfang Shan ◽  
Xiao Min

2016 ◽  
Vol 54 ◽  
pp. 157-162
Author(s):  
J. Fàbrega ◽  
J. Martí-Farré ◽  
X. Muñoz

2020 ◽  
Vol 1531 ◽  
pp. 012073
Author(s):  
S Banu Priya ◽  
A Parthiban ◽  
P Abirami

2019 ◽  
Vol 22 (6) ◽  
pp. 1121-1127
Author(s):  
T. N. Saibavani ◽  
N. Parvathi

2016 ◽  
Vol Vol. 18 no. 3 (Graph Theory) ◽  
Author(s):  
Paul Dorbec ◽  
Seethu Varghese ◽  
Ambat Vijayakumar

International audience In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for $\gamma_{p,k}(G-e)$, $\gamma_{p,k}(G/e)$ and for $\gamma_{p,k}(G-v)$ in terms of $\gamma_{p,k}(G)$, and give examples for which these bounds are tight. We characterize all graphs for which $\gamma_{p,k}(G-e) = \gamma_{p,k}(G)+1$ for any edge $e$. We also consider the behaviour of the propagation radius of graphs by similar modifications.


Sign in / Sign up

Export Citation Format

Share Document