Related papers: Complete Classification of Directed Quantum Graphs…
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…
We develop a general framework for quantum field theory on noncommutative spaces, i.e., spaces with quantum group symmetry. We use the path integral approach to obtain expressions for $n$-point functions. Perturbation theory leads us to…
We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undirected determinants as well as permanents for planar graphs,…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of K one-dimensional oscillators attached at different points of the graph. This paper is a continuation of our…
A compact review is given, and a few new numerical results are added to the recent studies of the q-pointed one-dimensional star-shaped quantum graphs. These graphs are assumed endowed with certain specific, manifestly non-Hermitian point…
This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…
In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…
Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…
Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…
This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…
A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…
Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\gamma$ be endowed with an ordered set of edges…
The "noncommutative graphs" which arise in quantum error correction are a special case of the quantum relations introduced in [N. Weaver, Quantum relations, Mem. Amer. Math. Soc. 215 (2012), v-vi, 81-140]. We use this perspective to…
We address the "inverse problem" for discrete geometry, which consists in determining whether, given a discrete structure of a type that does not in general imply geometrical information or even a topology, one can associate with it a…
Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…
We study quantized dual graded graphs, which are graphs equipped with linear operators satisfying the relation DU - qUD = rI. We construct examples based upon: the Fibonacci poset, permutations, standard Young tableau, and plane binary…