Results 61 to 70 of about 140 (137)

Geodetic metrizations of graphs

open access: yesDiscrete Mathematics, 1999
A graph can be metrized by assigning a length to each of its edges. Such a graph is said to be geodetic if for each pair of vertices there is a unique geodesic joining them. The paper starts with proofs that every graph can be metrized in such a way that there are unique geodesics, each of which is a geodesic in the usual metrization with unit edge ...
Frank Rhodes, Robert A. Melter
openaire   +2 more sources

Advanced Manifold–Metric Pairs

open access: yesMathematics
This article presents a novel mathematical formalism for advanced manifold–metric pairs, enhancing the frameworks of geometry and topology. We construct various D-dimensional manifolds and their associated metric spaces using functional methods, with a ...
Pierros Ntelis
doaj   +1 more source

Use of Respiratory Protection Devices by Medical Students during the COVID-19 Pandemic. [PDF]

open access: yesInt J Environ Res Public Health, 2021
Shashina EA   +7 more
europepmc   +1 more source

What is a non-metrizable analog of metrizable compacta? (Part I)

open access: yesTopology and its Applications, 2012
This paper gives an answer to the question stated in the title. Metrizable compacta have the best properties from the point of view of general topology. The author introduces two class of compacta, called metrcompacta and weak metrcompacta, which properly contain all metrizable compacta, and proves that several nice theorems holding for metrizable ...
openaire   +2 more sources

A Convergence Not Metrizable

open access: yes
Certain notions of convergence of sequences of functions such as convergence pointwise, uniform and parts (compact sets or bounded sets) come from suitable topological functional spaces{m/1/}. Under certain conditions these topologies involved are metrizable, which in an advantage since there is an extensive theory on convergence in metric spaces ...
openaire   +2 more sources

The Structure of Metrizable Graphs

open access: yesDiscrete & Computational Geometry
Abstract A consistent path system in a graph G is an intersection-closed collection of paths, with exactly one path between any two vertices in G . We call G
Maria Chudnovsky   +2 more
openaire   +2 more sources

Complete positivity and distance-avoiding sets. [PDF]

open access: yesMath Program, 2022
DeCorte E, Filho FMO, Vallentin F.
europepmc   +1 more source

Home - About - Disclaimer - Privacy