Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Hinz Andreas M."'
Autor:
Balakrishnan, Kannan, Changat, Manoj, Dhanyamol, M V., Hinz, Andreas M., Koley, Hrishik, Lekha, Divya Sindhu
The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpi\'{n}ski triangle graphs. Sierpi\'{n}ski triangle graphs, also known as Sierpi\'{n}
Externí odkaz:
http://arxiv.org/abs/2408.12783
Autor:
Hinz Andreas M., Movarraei Nazanin
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 1095-1109 (2020)
Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, but structurally simpler Sierpiński graphs Snp. The most outstanding open problem is to find the domination number of Hanoi graphs. Here we concentrate
Externí odkaz:
https://doaj.org/article/351bf41ff2e045f092e7a39f515b8eb9
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 63-74 (2018)
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 a
Externí odkaz:
https://doaj.org/article/18eddb27325c451195a690d365951f7d
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:19-26
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:439-453
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:159-170
Publikováno v:
In Discrete Applied Mathematics 30 January 2017 217 Part 3:565-600
Autor:
HINZ, ANDREAS M.1 hinz@math.lmu.de, MOVARRAEI, NAZANIN2 nazanin.movarraei@gmail.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2020, Vol. 40 Issue 4, p1095-1109. 15p. 1 Diagram, 1 Graph.
Autor:
Hinz, Andreas M., Parisse, Daniele
Publikováno v:
In Discrete Mathematics 6 May 2012 312(9):1521-1535