Related papers: Reconstructing directed graphs from generalised ga…
The theory of Toeplitz quantization presented in our previous paper is extended and further developed to include diverse and interesting non-commutative realizations of the classical Euclidean plane. This is done using Hilbert spaces of…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
The abstract induced subgraph poset of a graph is the isomorphism class of the induced subgraph poset of the graph, suitably weighted by subgraph counting numbers. The abstract bond lattice and the abstract edge-subgraph poset are defined…
Let $A$ be a connected commutative $\C$-algebra with derivation $D$, $G$ a finite linear automorphism group of $A$ which preserves $D$, and $R=A^G$ the fixed point subalgebra of $A$ under the action of $G$. We show that if $A$ is generated…
We present the most general gauge-invariant action functional for coupled 1- and 2-form gauge fields with kinetic terms in generic dimensions, i.e. dropping eventual contributions that can be added in particular space-time dimensions only…
Let $G=(V,E)$ be a twinless strongly connected graph. a vertex $v\in V$ is a twinless articulation point if the subrgraph obtained from $G$ by removing the vertex $v$ is not twinless strongly connected. An edge $e\in E$ is a twinless bridge…
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…
A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…
Using the E-algebraic systems, various graded irreducible representations of a Leavitt path algebra L of a graph E over a field K are constructed. The concept of a Laurent vertex is introduced and it is shown that the minimal graded left…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…
We propose a scheme for generating a weakly chordal graph from a randomly generated input graph, G = (V, E). We reduce G to a chordal graph H by adding fill-edges, using the minimum vertex degree heuristic. Since H is necessarily a weakly…
We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random…
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity $\tilde{O}(n^{3/2})$;…
We present a generalization of the sl(2) algebra where the algebraic relations are constructed with the help of a general function of one of the generators. When this function is linear this algebra is a deformed sl(2) algebra. In the…
We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…
We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the egde labeling within the graph contributes to the abelian…
A directed graph $G=(V,E)$ is twinless strongly connected if it contains a strongly connected spanning subgraph without any pair of antiparallel (or twin) edges. The twinless strongly connected components (TSCCs) of a directed graph $G$ are…