Related papers: Essential paths space on ADE SU(3) graphs: A geome…
In this work we discuss the elements required for the construction of the operator algebra for the space of paths over a simply laced $SU(3)$ graph. These operators are an important step in the construction of the bialgebra required to find…
Given any simple biorientable graph it is shown that there exists a weak {*}-Hopf algebra constructed on the vector space of graded endomorphisms of essential paths on the graph. This construction is based on a direct sum decomposition of…
We study the structure of the space $\Omega_3(G)$ of $\partial$-invariant 3-paths in a directed graph $G$. We prove that $\Omega_3(G)$ admits a basis consisting of trapezohedral paths $\tau_m$ ($m \ge 2$) and their merging images. Moreover,…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
A linear-time algorithm for generating auxiliary subgraphs for the 3-edge-connected components of a connected multigraph is presented. The algorithm uses an innovative graph contraction operation and makes only one pass over the graph. By…
We define a graded multiplication on the vector space of essential paths on a graph $G$ (a tree) and show that it is associative. In most interesting applications, this tree is an ADE Dynkin diagram. The vector space of length preserving…
The path decomposition expansion is a path integral technique for decomposing sums over paths in configuration space into sums over paths in different spatial regions. It leads to a decomposition of the configuration space propagator across…
We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…
In this paper, firstly, we will study the structure of the path complex $(\Omega_*(G;\Z),\partial)$ of a digraph $G$ via the $\Z$-generators of $\Omega_*(G,\Z)$ under strongly regular condition, which is called the minimal path in…
An explicit and complete construction of the $SU(3)$ $A_1$ associated quantum groupoid is presented in this work, inspired by the approach taken by Trinchero for the $SU(2)$ $A_l$ graphs. New creation and annihilation operators were defined…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…
Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic distances on discrete surfaces. Traditionally, the concept of…
We show that for every l, there exists d_l such that every 3-edge-connected graph with minimum degree d_l can be edge-partitioned into paths of length l (provided that its number of edges is divisible by l). This improves a result asserting…
Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices…
A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…
A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with…
Recently $C^m$-conforming finite elements on simplexes in arbitrary dimension are constructed by Hu, Lin and Wu. The key in the construction is a non-overlapping decomposition of the simplicial lattice in which each component will be used…
We consider edge decompositions of the $n$-dimensional hypercube $Q_n$ into isomorphic copies of a given graph $H$. While a number of results are known about decomposing $Q_n$ into graphs from various classes, the simplest cases of paths…