Related papers: Uniqueness of exterior differentiation on locally …

In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction-diffusion equations.

A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…

The main purpose of this paper is to prove the uniqueness of a graph attaining the maximum of the number of independent sets over all $k$-regular graphs on $n$ vertices for $2k|n$.

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…

We show that the "grandfather graph" has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself.

In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

As a natural generalization of line graphs, Hoffman line graphs were defined by Woo and Neumaier. Especially, Hoffman line graphs are closely related to the smallest eigenvalue of graphs, and the uniqueness of strict covers of a Hoffman…

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected, finite, regular graphs admit a distinguishing…

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…

In this paper we study the Kato' inequality on locally finite graph. We also study the application of Kato inequality to Ginzburg-Landau equations on such graphs. Interesting properties of Schrodinger equation and a Liouville type theorem…

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

The Exterior-Interior duality expresses a deep connection between the Laplace spectrum in bounded and connected domains in $\mathbb{R}^2$, and the scattering matrices in the exterior of the domains. Here, this link is extended to the study…

An undirected graph is said to have \emph{unique neighborhoods} if any two distinct nodes have also distinct sets of neighbors. In this way, the connections of a node to other nodes can characterize a node like an "identity", irrespectively…