# 8469

## Автор(ов):

1

Параметры публикации

Тезисы доклада

## Название:

Graph Laplacians and Logarithmic Forest Distances

## Наименование конференции:

• 16th Conference of the International Linear Algebra Society (Pisa, Italy, 2010)

## Наименование источника:

• Proceedings of the 16th Conference of the International Linear Algebra Society (Pisa, Italy, 2010)

• Pisa, Italy

## Издательство:

• University of Pisa

2010

## Страницы:

32
Аннотация
Abstract. The problem of characterizing essentially cyclic digraphs is difficult and yet unsolved. In the present paper, this problem is solved with respect to the class of digraphs with ring structure. By such a digraph we mean a digraph that contains a Hamiltonian cycle and whose remaining arcs belong to the inverse Hamiltonian cycle. We also consider the problem of essential cyclicity for weighted digraphs.

## Библиографическая ссылка:

Чеботарев П.Ю. Graph Laplacians and Logarithmic Forest Distances / Proceedings of the 16th Conference of the International Linear Algebra Society (Pisa, Italy, 2010). Pisa, Italy: University of Pisa, 2010. С. 32.