# 16497

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

1

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

## Тип публикации:

Статья в журнале/сборнике

## Название:

The Walk Distances in Graphs

0166-218X

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

• Discrete Applied Mathematics

V. 160, № 10-11

• Amsterdam

• Elsevier

2012

## Страницы:

1484-1500. http://dx.doi.org/10.1016/j.dam.2012.02.015
Аннотация
The walk distances in graphs are defined as the result of appropriate transformations of the \sum_{k=0}^\infty(tA)^k proximity measures, where A is the weighted adjacency matrix of a graph and t is a sufficiently small positive parameter. The walk distances are graph-geodetic; moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter t approaches its limiting values. We also show that the logarithmic forest distances which are known to generalize the resistance distance and the shortest path distance are a specific subclass of walk distances. On the other hand, the long walk distance is equal to the resistance distance in a transformed graph.

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

Чеботарев П.Ю. The Walk Distances in Graphs // Discrete Applied Mathematics. 2012. V. 160, № 10-11. С. 1484-1500. http://dx.doi.org/10.1016/j.dam.2012.02.015.