Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Daniele Parisse"'
Autor:
Daniele Parisse
Publikováno v:
Proceedings of the 3rd Croatian Combinatorial Days.
Autor:
Paul K. Stockmeyer, Ciril Petr, Daniele Parisse, Thierry Bousch, Andreas M. Hinz, Sandi Klavžar
Publikováno v:
Discrete Mathematics, Algorithms and Applications
Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2019, 11 (04), pp.1950049. ⟨10.1142/S1793830919500496⟩
Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2019, 11 (04), pp.1950049. ⟨10.1142/S1793830919500496⟩
International audience; Providing the example of a disc whose number of moves performed in a minimal solution for the Tower of Hanoi problem is not a power of two, we show that the argument given in an article by R. Demontis in this journal is false
Autor:
Andreas M. Hinz, Daniele Parisse
Publikováno v:
Discrete Mathematics. 312:1521-1535
It is shown that all Hanoi and Sierpiński graphs are in edge- and total coloring class 1, except those isomorphic to a complete graph of odd or even order, respectively. New proofs for their classification with respect to planarity are also given.
Autor:
Andreas M. Hinz, Daniele Parisse
Publikováno v:
Graphs and Combinatorics. 28:671-686
We determine the eccentricity of an arbitrary vertex, the average eccentricity and its standard deviation for all Sierpinski graphs \({S_p^n}\). Special cases are the graphs \({S_2^{n}}\), which are isomorphic to the state graphs of the Chinese Rings
Autor:
Daniele Parisse, Andreas M. Hinz
Publikováno v:
Expositiones Mathematicae. 20:263-268
Hanoi graphs are the state graphs for Tower of Hanoi problems with three or more pegs. We prove hamiltonicity and present a complete analysis of planarity of these graphs.
Publikováno v:
European Journal of Combinatorics. (5):693-708
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between any fixed pair of vertices. A formula is given that counts, for a given vertex v, the number of vertices u such that there are two shortest u,v-paths