Power Domination in Knödel Graphs and Hanoi Graphs

In this paper, we study the power domination problem in Knödel graphs WΔ,2ν and Hanoi graphs Hpn$H_p^n $ . We determine the power domination number of W3,2ν and provide an upper bound for the power domination number of Wr+1,2r+1 for r ≥ 3. We also compute the k-power domination number and the k-pro...

Full description

Bibliographic Details
Main Authors: Varghese Seethu, Vijayakumar A., Hinz Andreas M.
Format: Article
Language:English
Published: University of Zielona Góra 2018-02-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1993
_version_ 1797717996437766144
author Varghese Seethu
Vijayakumar A.
Hinz Andreas M.
author_facet Varghese Seethu
Vijayakumar A.
Hinz Andreas M.
author_sort Varghese Seethu
collection DOAJ
description In this paper, we study the power domination problem in Knödel graphs WΔ,2ν and Hanoi graphs Hpn$H_p^n $ . We determine the power domination number of W3,2ν and provide an upper bound for the power domination number of Wr+1,2r+1 for r ≥ 3. We also compute the k-power domination number and the k-propagation radius of Hp2$H_p^2$ .
first_indexed 2024-03-12T08:44:33Z
format Article
id doaj.art-18eddb27325c451195a690d365951f7d
institution Directory Open Access Journal
issn 2083-5892
language English
last_indexed 2024-03-12T08:44:33Z
publishDate 2018-02-01
publisher University of Zielona Góra
record_format Article
series Discussiones Mathematicae Graph Theory
spelling doaj.art-18eddb27325c451195a690d365951f7d2023-09-02T16:29:59ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922018-02-01381637410.7151/dmgt.1993dmgt.1993Power Domination in Knödel Graphs and Hanoi GraphsVarghese Seethu0Vijayakumar A.1Hinz Andreas M.2Department of Mathematics, Cochin University of Science and Technology, Cochin-682022, IndiaDepartment of Mathematics, Cochin University of Science and Technology, Cochin-682022, IndiaDepartment of Mathematics, Ludwig-Maximilians-Universität München, 80333Munich, Germany; Institute for Mathematics, Physics, and Mechanics, 1000Ljubljana, SloveniaIn this paper, we study the power domination problem in Knödel graphs WΔ,2ν and Hanoi graphs Hpn$H_p^n $ . We determine the power domination number of W3,2ν and provide an upper bound for the power domination number of Wr+1,2r+1 for r ≥ 3. We also compute the k-power domination number and the k-propagation radius of Hp2$H_p^2$ .https://doi.org/10.7151/dmgt.1993dominationpower dominationknödel graphhanoi graph05c69
spellingShingle Varghese Seethu
Vijayakumar A.
Hinz Andreas M.
Power Domination in Knödel Graphs and Hanoi Graphs
Discussiones Mathematicae Graph Theory
domination
power domination
knödel graph
hanoi graph
05c69
title Power Domination in Knödel Graphs and Hanoi Graphs
title_full Power Domination in Knödel Graphs and Hanoi Graphs
title_fullStr Power Domination in Knödel Graphs and Hanoi Graphs
title_full_unstemmed Power Domination in Knödel Graphs and Hanoi Graphs
title_short Power Domination in Knödel Graphs and Hanoi Graphs
title_sort power domination in knodel graphs and hanoi graphs
topic domination
power domination
knödel graph
hanoi graph
05c69
url https://doi.org/10.7151/dmgt.1993
work_keys_str_mv AT vargheseseethu powerdominationinknodelgraphsandhanoigraphs
AT vijayakumara powerdominationinknodelgraphsandhanoigraphs
AT hinzandreasm powerdominationinknodelgraphsandhanoigraphs