On Proximity Measures for Graph Vertices

Simple item page
dc.creatorChebotarev, Pavel
dc.creatorShamis, Elena
dc.date2006-02-05
dc.date.accessioned2026-07-07T07:03:07Z
dc.date.available2026-07-07T07:03:07Z
dc.descriptionWe study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted structures and take into account not only the shortest, but also all other connections, which is desirable in many applications. To apply these proximity measures to unweighted structures, every edge should be assigned the same weight which determines the proportion of taking account of two routes, from which one is one edge longer than the other. Among the proximity measures we consider path accessibility, route accessibility, relative forest accessibility along with its components, accessibility via dense forests, and connection reliability. A number of characteristic conditions is introduced and employed to characterize the proximity measures. A topological interpretation is obtained for the Moore-Penrose generalized inverse of the Laplacian matrix of a weighted multigraph.
dc.description17 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0602073
dc.identifierhttp://arxiv.org/abs/math/0602073
dc.identifierAutomation and Remote Control 59 (1998), No. 10, Part 2 1443-1459. Erratum: 60 (1999), No. 2, Part 2 297
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108849
dc.subjectCombinatorics
dc.subjectData Structures and Algorithms
dc.subjectNetworking and Internet Architecture
dc.subjectMetric Geometry
dc.subject05C50; 05C05; 15A09; 15A51
dc.titleOn Proximity Measures for Graph Vertices
dc.typetext

Files

Collections

arXiv