Open Problems for Hanoi and Sierpiński Graphs

Hinz, Andreas M.

Electronic notes in discrete mathematics, 2017-12, Vol.63, p.23-31

Texto completo disponível

Citações Citado por

Título:
Open Problems for Hanoi and Sierpiński Graphs
Autor: Hinz, Andreas M.
Assuntos: graph distance ; graph parameters ; Hanoi graphs ; Sierpiński graphs
É parte de: Electronic notes in discrete mathematics, 2017-12, Vol.63, p.23-31
Descrição: We list some unsolved problems concerning two meanwhile famous classes of graphs, namely the Hanoi graphs and the Sierpiński graphs. Whereas many graph parameters have been determined and metric properties are well-understood for the latter, the former give rise to notoriously difficult questions, in particular when it comes to distance-related tasks.
Editor: Elsevier B.V
Idioma: Inglês

Voltar para lista de resultados