In this article, we investigate the structure of uniformly k $k$ -connected and -edge-connected graphs. Whereas both types have previously been studied independent each other, analyze relations between these two classes. We prove that any graph is also for ≤ 3 $k\le 3$ demonstrate not case > $k\gt . Furthermore, graphs are well understood 2 2$ it known how to construct 3-edge-connected contribu...

We introduce the notion of uniformly refinable map for compact, Hausdorff spaces, as a generalization maps originallydefined metric continua by Jo Ford (Heath) and Jack W. Rogers, Jr., Refinable maps, Colloq. Math., 39 (1978), 263-269.

Resumen— Usando un modelo de agentes se realizó un análisis de un sistema bipartidista con el fin de identificar un patrón de comportamiento en la influencia ejercida por los votos duros en la proporción del número de votos anulados durante una elección. En una red toroidal 2d, donde cada nodo se conecta con sus cuatro vecinos más cercanos, se introduce el concepto de una Red de opinión con nod...

in this paper, we introduce the concept of dynamical distance on a nuclear con-guration space. we partition the nuclear conguration space into disjoint classes. this clas-sication coincides with the classical partitioning of molecular systems via the concept ofconjugacy of dynamical systems. it gives a quantitative criterion to distinguish dierentmolecular structures.