Related papers: Graphs on surfaces with positive Forman curvature …
For Legendre curves, we consider surfaces of revolution of frontals. The surface of revolution of a frontal can be considered as a framed base surface. We give the curvatures and basic invariants for surfaces of revolution by using the…
Existing approaches for classifying dynamic graphs either lift graph kernels to the temporal domain, or use graph neural networks (GNNs). However, current baselines have scalability issues, cannot handle a changing node set, or do not take…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…
This paper investigates circle patterns with obtuse exterior intersection angles on surfaces of finite topological type. We characterise the images of the curvature maps and establish several equivalent conditions regarding long time…
Graphs can have different properties that lead to several graph types and may allow for a varying representation of diverse information. In order to clarify the modeling power of graphs, we introduce a partial order on the most common graph…
Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…
With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…
For surfaces without boundary, nonlocal notions of directional and mean curvatures have been recently given. Here, we develop alternative notions, special cases of which apply to surfaces with boundary. Our main tool is a new fractional or…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
We study the topological configurations of the lines of principal curvature, the asymptotic and characteristic curves on a cuspidal edge, in the domain of a parametrization of this surface as well as on the surface itself. Such…
We define a new notion of total curvature, called net total curvature, for finite graphs embedded in Rn, and investigate its properties. Two guiding principles are given by Milnor's way of measuring the local crookedness of a Jordan curve…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
Given an oriented surface of positive genus with finitely many punctures, we classify the finite orbits of the mapping class group action on the moduli space of semisimple complex special linear two dimensional representations of the…
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…
We investigate the geometric characteristics of constant gaussian curvature surfaces obtained from solutions of the $G(m,n)$ sigma model. Most of these solutions are related to the Veronese sequence. We show that we can distinguish surfaces…
Graph classification aims to categorise graphs based on their structure and node attributes. In this work, we propose to tackle this task using tools from graph signal processing by deriving spectral features, which we then use to design…
We classify all possible automorphism groups of smooth cubic surfaces over an algebraically closed field of arbitrary characteristic. As an intermediate step we also classify automorphism groups of quartic del Pezzo surfaces. We show that…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
This paper is the first part in a 2 part study of an elementary functorial construction from the category of finite non-abelian groups to a category of singular compact, oriented 2-manifolds. After a desingularization process this…