Related papers: Interplay of Cubic Graphs and Simplicial Surfaces
It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
We show that, for every n and every surface $\Sigma$, there is a graph U embeddable on $\Sigma$ with at most cn^2 vertices that contains as minor every graph embeddable on $\Sigma$ with n vertices. The constant c depends polynomially on the…
Firstly, we characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation of graph planarity, by nine excluded minors. This answers…
In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
The aim of the present paper is to clarify the relationship between immersions of surfaces and solutions of the inhomogeneous Dirac equation. The main idea leading to the description of a surface M^2 by a spinor field is the observation…
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
We investigate geometric invariants of cuspidal edges on focal surfaces of regular surface. In particular, we shall clarify the sign of the singular curvature at a cuspidal edge on a focal surface using singularities of parallel surface of…
We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the…
A configuration of the triple $(\mathcal{P}, \mathcal{L}, \mathcal{I})$ on the incidence relation which holds the properties of "Any two points are incident with at most one line" and "Any two lines are incident with at most one point". In…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…
We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on $\mathbb S^3$ and to rectangular…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…
Mapping complex input data into suitable lower dimensional manifolds is a common procedure in machine learning. This step is beneficial mainly for two reasons: (1) it reduces the data dimensionality and (2) it provides a new data…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…