Related papers: Canonical forms of metric graph eikonal algebra an…

A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…

Inspired by the work of Paterson on $C^{\ast}$-algebras of directed graphs, we show how to associate a groupoid $\mathfrak{G}_{\mathcal{G}}$ to an ultragraph $\mathcal{G}$ in such a way that the $C^*$-algebra of $\mathfrak{G}_{\mathcal{G}}$…

Given a graph $E$, an action of a group $G$ on $E$, and a $G$-valued cocycle $\phi$ on the edges of $E$, we define a C*-algebra denoted ${\cal O}_{G,E}$, which is shown to be isomorphic to the tight C*-algebra associated to a certain…

Let \(G\) be a finite simple graph and let \(T\) be its Hashimoto operator on the directed-edge space. We show that edge reversal induces a canonical symmetric/antisymmetric splitting under which \(T\) acquires an explicit \(2\times 2\)…

Let X be a tropical curve (or metric graph), and fix a base point p on X. We define the Jacobian group J(G) of a finite weighted graph G, and show that the Jacobian J(X) is canonically isomorphic to the direct limit of J(G) over all…

Let $\Gamma$ be the fundamental group of a finite connected graph $\mathcal G$. Let $\mathfrak M$ be an abelian group. A {\it distribution} on the boundary $\partial\Delta$ of the universal covering tree $\Delta$ is an $\mathfrak M$-valued…

We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…

The fractional versions of graph theoretic-invariants multiply the range of applications in scheduling, assignment and operational research problems. In this paper, we introduce the fractional version of local metric dimension of graphs.…

This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…

$\Gamma$-conformal algebra is an axiomatic description of the operator product expansion of chiral fields with simple poles at finitely many points. We classify these algebras and their representations in terms of Lie algebras and their…

We give entropy estimates for two canonical non commutative shifts on $C^*$-algebras associated to some topological graphs $E=(E^0,E^1,s,r)$, defined using a basis of the corresponding Hilbert bimodule $H(E)$. We compare their entropies…

We show that the extended principal bundle of a Cartan geometry of type $(A(m,\mathbb{R}),GL(m,\mathbb{R}))$, endowed with its extended connection $\hat\omega$, is isomorphic to the principal $A(m,\mathbb{R})$-bundle of affine frames…

The {\em independent domination number} $\gamma^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $\gamma^i$ is equal…

We characterize the canonical algebras such that for all dimension vectors of homogeneous modules the corresponding module varieties are complete intersections (respectively, normal). We also investigate the sets of common zeros of…

In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…

A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$, no neighbor of $v$ is further away from $u$ than $v$. The boundary $\partial(G)$ of $G$ is the set of all of its boundary…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Let $G$ be a graph with $n$ vertices, and let $A(G)$ and $D(G)$ denote respectively the adjacency matrix and the degree matrix of $G$. Define $$ A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G) $$ for any real $\alpha\in [0,1]$. The collection of…

Let $\Gamma$ be a connected regular graph with an eigenvalue $\lambda$ and corresponding idempotent $E_{\lambda}$. Let ${\cal E}_{\lambda}=\langle J,E_{\lambda}\rangle^\circ$ be the algebra generated by $J$ and $E_\lambda$ with respect to…

An orientation of a graph $G$ is {\it in-out-proper} if any two adjacent vertices have different in-out-degrees, where the in-out-degree of each vertex is equal to the in-degree minus the out-degree of that vertex. The {\it in-out-proper…