Related papers: Graphs, defined by Weyl distance or incidence, tha…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
An automorphism of a building is called uniclass if the Weyl distance between any chamber and its image lies in a unique (twisted) conjugacy class of the Coxeter group. In a previous paper we characterised uniclass automorphisms of…
We examine relations between geometry and the associated curvature decompositions in Weyl geometry.
We consider the Principle of Equivalence along with Weyl theorem to discuss the interpretation of gravity as a geometric effect; we study what are the restrictions on the connections that must be required for this geometrization to occur in…
In this paper, we analyze the definition Andr\'e proposed for near-vector spaces to make it more transparent. We also study the class of near-vector spaces over division rings and give a characterization of regularity that gives a new…
Motivated by an axiomatic approach to characterize space-time it is investigated a reformulation of Einstein's gravity where the pseudo-riemannian geometry is substituted by a Weyl one. It is presented the main properties of the Weyl…
We construct Grassmann spaces associated with the incidence geometry of regular and tangential subspaces of a symplectic copolar space, show that the underlying metric projective space can be recovered in terms of the corresponding…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
As graphical summaries for topological spaces and maps, Reeb graphs are common objects in the computer graphics or topological data analysis literature. Defining good metrics between these objects has become an important question for…
Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others. Discovery and…
For a vector space $V$ the \emph{intersection graph of subspaces} of $V$, denoted by $G(V)$, is the graph whose vertices are in a one-to-one correspondence with proper nontrivial subspaces of $V$ and two distinct vertices are adjacent if…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…