Related papers: Smooth Graphs
In the present paper, we propose a new discrete surface theory on 3-valent embedded graphs in the 3-dimensional Euclidean space which are not necessarily discretization or approximation of smooth surfaces. The Gauss curvature and the mean…
Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to…
O'Donnell, Wright, Wu and Zhou [SODA 2014] introduced the notion of robustly asymmetric graphs. Roughly speaking, these are graphs in which for every $0 \le \rho \le 1$, every permutation that permutes a $\rho$ fraction of the vertices maps…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
We introduce the concept of a $k$-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the…
A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…
We introduce the notion of a $p$-Cartier smooth algebra. It generalises that of a smooth algebra and includes valuation rings over a perfectoid base. We give several characterisations of $p$-Cartier smoothness in terms of prismatic…
There are several notions of a smooth map from a convex set to a cartesian space. Some of these notions coincide, but not all of them do. We construct a real-valued function on a convex subset of the plane that does not extend to a smooth…
Graph signal processing (GSP) is a key tool for satisfying the growing demand for information processing over networks. However, the success of GSP in downstream learning and inference tasks is heavily dependent on the prior identification…
In this paper, we are interested in learning the underlying graph structure behind training data. Solving this basic problem is essential to carry out any graph signal processing or machine learning task. To realize this, we assume that the…
The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement…
We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…
A graphon that is defined on $[0,1]^d$ and is H\"older$(\alpha)$ continuous for some $d\ge2$ and $\alpha\in(0,1]$ can be represented by a graphon on $[0,1]$ that is H\"older$(\alpha/d)$ continuous. We give examples that show that this…
We introduce an information-theoretic framework for smooth structures on topological manifolds, replacing coordinate charts with small-scale entropy data of local probability probes. A concise set of axioms identifies admissible coordinate…
Inspired by a famous characterization of perfect graphs due to Lov\'{a}sz, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$, $\alpha(H) + \omega(H) \geq |V(H)|$. (Here $\alpha$ and $\omega$ denote the…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…