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

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

In this paper we introduce an inverse semigroup $\mathcal{S}(E,C)$ associated to a separated graph $(E,C)$ and describe its internal structure. In particular we show that it is strongly $E^*$-unitary and can be realized as a partial…

$\omega$-periodic graphs are introduced and studied. These are graphs which arise as the limits of periodic extensions of the nearest neighbor graph on the integers. We observe that all bounded degree $\omega$-periodic graphs are ameanable.…

We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a field $K$ as a direct sum of matrix rings over $K$, direct sum with a corner of the Leavitt…

We complement the characterization of the graph products of cyclic groups $G(\Gamma, \mathfrak{p})$ admitting a Polish group topology of [9] with the following result. Let $G = G(\Gamma, \mathfrak{p})$, then the following are equivalent:…

Given a graph $\Gamma$, one may conside the set $X$ of its vertices as a metric space by assuming that all edges have length one. We consider two versions of homology theory of $\Gamma$ and their $K$-theory counterparts -- the $K$-theory of…

A set of edges $\Gamma$ of a graph $G$ is an edge dominating set if every edge of $G$ intersects at least one edge of $\Gamma$, and the edge domination number $\gamma_e(G)$ is the smallest size of an edge dominating set. Expanding on work…

String backgrounds and D-branes do not possess the structure of Lorentzian manifolds, but that of manifolds with area metric. Area metric geometry is a true generalization of metric geometry, which in particular may accommodate a B-field.…

The well-known theory of "rational canonical form of an operator" describes the invariant factors, or elementary divisors, as a complete set of invariants of a similarity class of an operator on a finite-dimensional vector space $\V$ over a…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Let $\Gamma$ be a finite d-valent graph and G an n-dimensional torus. An ``action'' of G on $\Gamma$ is defined by a map, $\alpha$, which assigns to each oriented edge e of $\Gamma$ a one-dimensional representation of G (or, alternatively,…

We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…

We consider when the universal $C^*$-algebras associated to edge-colored directed graphs are exact. Specifically, for countable edge-colored directed graphs we show that the universal $C^*$-algebra is exact if and only if the $C^*$-algebra…

This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows and linear programming in order to obtain results on the…

A 3-dimensional graph-manifold is composed from simple blocks which are products of compact surfaces with boundary by the circle. Its global structure may be as complicated as one likes and is described by a graph which might be an…

We construct a canonical frame for an arbitrary Gl(2)-structure thus solving the equivalence problem for Gl(2)-structures. Our treatment includes also a problem of contact equivalence of ordinary differential equations and applies to…

We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…

Geometrical optics describes, with good accuracy, the propagation of high-frequency plane waves through an electromagnetic medium. Under such approximation, the behaviour of the electromagnetic fields is characterised by just three…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathcal{I}(G)$, is the graph whose vertices correspond to the…

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…