Related papers: Axiomatic Theory of Betweenness

One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…

In this paper, we explore a taxonomy of connectivity for space-like structures. It is inspired by isolating posets of connected pieces of a space and examining its embedding in the ambient space. The taxonomy includes in its scope all…

Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as…

We discuss the possibility of making the {\it initial} definitions of mutually different (possibly interacting, or even entangled) systems in the context of decoherence theory. We point out relativity of the concept of elementary physical…

This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…

Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…

The structure entropy is an important index to illuminate the structure property of the complex network. Most of the existing structure entropies are based on the degree distribution of the complex network. But the structure entropy based…

Betweenness centrality is a classic measure that quantifies the importance of a graph element (vertex or edge) according to the fraction of shortest paths passing through it. This measure is notoriously expensive to compute, and the best…

In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…

We perform the first axiomatic analysis of medial centrality measures. These measures, also called betweenness-like centralities, assess the role of a node in connecting others in the network. We focus on a setting with one target node and…

The allocation of resources among multiple agents is a fundamental problem in both economics and computer science. In these settings, fairness plays a crucial role in ensuring social acceptability and practical implementation of resource…

Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…

Chen and Chv\'atal conjectured in 2008 that in any finite metric space either there is a line containing all the points - a universal line -, or the number of lines is at least the number of points. This is a generalization of a classical…

This article investigates the connectivity dimension of a graph. We introduce this concept in analogy to the metric dimension of a graph, providing a graph parameter that measures the heterogeneity of the connectivity structure of a graph.…

We advocate an account of dualities between physical theories: the basic idea is that dual theories are isomorphic representations of a common core. We defend and illustrate this account, which we call a Schema, in relation to symmetries.…

In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality is efficiently computable and it is a fundamental tool in…

The proximity $\pi = \pi (G)$ of a connected graph $G$ is the minimum, over all vertices, of the average distance from a vertex to all others. Similarly, the maximum is called the remoteness and denoted by $\rho = \rho (G)$. The concepts of…

A rational map between certain specific threefolds is given in an explicit manner.

A new formulation of what may be called the "fundamental theorem of the theory of relativity" is presented and proved in (3+1)-space-time, based on the full classification of special transformations and the corresponding velocity addition…

Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study…