Related papers: A notion of graph homeomorphism
For Gamma a finite, connected metric graph, we consider the space of configurations of n points in Gamma with a restraint parameter r dictating the minimum distance allowed between each pair of points. These restricted configuration spaces…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical…
We show P\'eter Csorba's conjecture that the graph homomorphism complex Hom(C_5,K_{n+2}) is homeomorphic to a Stiefel manifold, the space of unit tangent vectors to the n-dimensional sphere. For this a general tool is developed that allows…
We consider a possibility of the existence of intersection homology morphism, which would be associated to a map of analytic varieties. We assume that the map is an inclusion of codimension one. Then the existence of a morphism follows from…
I demonstrate that the chart based approach to the study of the global structure of Lorentzian manifolds induces a homeomorphism of the manifold into a topological space as an open dense set. The topological boundary of this homeomorphism…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
This paper introduces a novel topology, referred to as the star topology, on finite graphs. By treating vertices and edges as points in a unified space, we explore continuous maps between Bare representations of a graph and their…
We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…
In this paper we focus on the set-open topologies on the group $\mathcal{H}(X)$ of all self-homeomorphisms of a topological space $X$ which yield continuity of both the group operations, product and inverse function. As a consequence, we…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…
In this paper, we present two types of Lefschetz numbers in the topology of digital images. Namely, the simplicial Lefschetz number $L(f)$ and the cubical Lefschetz number $\bar L(f)$. We show that $L(f)$ is a strong homotopy invariant and…
The classical Lefschetz fixed point theorem states that the number of fixed points, counted with multiplicity $\pm 1$, of a smooth map $f$ from a manifold $M$ to itself can be calculated as the alternating sum $\sum (-1)^k \textrm{ tr }…
In analogy to the topological entropy for continuous endomorphisms of totally disconnected locally compact groups, we introduce a notion of topological entropy for continuous endomorphisms of locally linearly compact vector spaces. We study…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
We extend to binary relational systems the notion of compact and normal structure, introduced by J.P.Penot for metric spaces, and we prove that for the involutive and reflexive ones, every commuting family of relational homomorphisms has a…
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…