Related papers: Cycle decompositions: from graphs to continua
A finite subgroup of the conformal group SL(2,C) can be related to invariant polynomials on a hypersurface in C^3. The latter then carries a simple singularity, which resolves by a finite iteration of basic cycles of deprojections. The…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
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 periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
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…
Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving…
We give a new approach to intersection theory. Our "cycles" are closed manifolds mapping into compact manifolds and our "intersections" are elements of a homotopy group of a certain Thom space. The results are then applied in various…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
Graph Signal Processing deals with the problem of analyzing and processing signals defined on graphs. In this paper, we introduce a novel filtering method for graph-based signals by employing ideas from topological data analysis. We begin…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
A cycle of length $t$ in a hypergraph is an alternating sequence $v_1,e_1,v_2\dots,v_t,e_t$ of distinct vertices $v_i$ and distinct edges $e_i$ so that $\{v_i,v_{i+1}\}\subseteq e_i$ (with $v_{t+1}:=v_1$). Let $\lambda K_n^h$ be the…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
We prove the following 30-year old conjecture of Gy\H{o}ri and Tuza: the edges of every $n$-vertex graph $G$ can be decomposed into complete graphs $C_1,\ldots,C_\ell$ of orders two and three such that $|C_1|+\cdots+|C_\ell|\le…
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…
In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…
This paper defines new intersection homology groups. The basic idea is this. Ordinary homology is locally trivial. Intersection homology is not. It may have significant local cycles. A local-global cycle is defined to be a family of such…
We characterize when a generalized Baumslag-Solitar group is linear, and extend the result to the fundamental groups of a graph of groups with infinite virtually cyclic vertex and edge groups.
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
Whitney's Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there.