Skip to content
Research Article Open access CC BY 4.0

On Frink's Type Metrization of Weighted Graphs

Mara Florencia Acosta, Hugo Aimar, Ivana Gomez

Asian Research Journal of Mathematics · pp. 26–37 · Published 20 Feb 2021

10.9734/arjom/2021/v17i130262

Abstract

Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric d(x, y) between the vertices x and y of an anity weighted undirected graph.

Metrization uniform spaces weighted graphs.

Cited by 1

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

1

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.