Related papers: Canonical forms of metric graph eikonal algebra an…
One of the fundamental concepts in the statistical mechanics field is that of ensemble. Ensembles of graphs are collections of graphs, defined according to certain rules. The two most used ensembles in network theory are the microcanonical…
We give a unified method for the general equivalence problem of extrinsic geometry, on the basis of our formulation of a general extrinsic geometry as that of an osculating map $\varphi\colon (M,\mathfrak f) \to L/L^0 \subset…
A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…
The second author showed how Katsura's construction of the C*-algebra of a topological graph E may be twisted by a Hermitian line bundle L over the edge space E. The correspondence defining the algebra is obtained as the completion of the…
We attach to each finite bipartite separated graph (E,C) a partial dynamical system (\Omega(E,C), F, \theta), where \Omega(E,C) is a zero-dimensional metrizable compact space, F is a finitely generated free group, and {\theta} is a…
Since the time when the first optical instruments have been invented, an idea that the visible image of an object under observation depends on tools of observation became commonly assumed in physics. A way to formalize it in mathematics is…
We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…
Let $\Gamma=(\mathcal{V},\mathcal{E})$ be a graph, whose vertices $v\in \mathcal{V}$ are colored black and white and labeled with invertible elements $\lambda_v$ from a commutative and associative ring $R$ containing $\pm 1$. Then we…
We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…
The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…
We prove directly that if E is a directed graph in which every cycle has an entrance, then there exists a C*-algebra which is co-universal for Toeplitz-Cuntz-Krieger E-families. In particular, our proof does not invoke ideal-structure…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…
The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. It is a known result…
Using the language of string diagrams, we define categorical generalizations of modules for map algebras $\mathfrak{g} \otimes A$ and equivariant map algebras $(\mathfrak{g} \otimes A)^\Gamma$, where $\mathfrak{g}$ is a Lie algebra, $A$ is…
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…
In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…