Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Hanoi graph

Sortuj według:

Ogranicz wyniki do:

Power Domination in Knödel Graphs and Hanoi Graphs

100%

Varghese S., Vijayakumar A., Hinz A. M.

Discussiones Mathematicae Graph Theory

2017

tom 38

nr 1

63-74

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$ .

Sierpiński graphs as spanning subgraphs of Hanoi graphs

100%

Hinz A., Klavžar S., Zemljič S.

Open Mathematics

2013

tom 11

nr 6

1153-1157

Hanoi graphs H pn model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs S pn arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that S pn embeds as a spanning subgraph into H pn if and only if p is odd or, trivially, if n = 1.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Open Mathematics

1 Hinz A.

1 Hinz A. M.

1 Klavžar S.

1 Varghese S.

1 Vijayakumar A.

1 Zemljič S.

1 2018

1 2013

Wyniki wyszukiwania

Power Domination in Knödel Graphs and Hanoi Graphs

Sierpiński graphs as spanning subgraphs of Hanoi graphs