Related papers: Polynomial invariants of cyclically ordered graphs
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 define and study a bigraded knot invariant whose Euler characteristic is the Alexander polynomial, closely connected to knot Floer homology. The invariant is the homology of a chain complex whose generators correspond to Kauffman states…
The fundamental problem of knot theory is to know whether two knots are equivalent or not. As a tool to prove that two knots are different, mathematicians have developed various invariants. Knots invariants are just functions that can be…
We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…
Some connections between quadratic forms over the field of two elements, Clifford algebras of quadratic forms over the real numbers, real graded division algebras, and twisted group algebras will be highlighted. This allows to revisit real…
Combinatorial formulas expressing cyclic rook polynomials and cyclic permanents of rectangular matrices in terms of expansions along rows are presented
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
The theory of quandle (co)homology and cocycle knot invariants is rapidly being developed. We begin with a summary of these recent advances. One such advance is the notion of a dynamical cocycle. We show how dynamical cocycles can be used…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
Let ${\cal{C}}_1$ be the set of fundamental cycles of breadth-first-search trees in a graph $G$ and ${\cal{C}}_2$ the set of the sums of two cycles in ${\cal{C}}_1$. Then we show that $(1) {\cal{C}}={\cal{C}}_1\bigcup{\cal{C}}_2$ contains a…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
Let $\core G$ and $\corona G$ denote the intersection and the union, respectively, of all maximum independent sets of a graph $G$. In this work, we show that for a graph with at most two odd cycles, $\a{\core G}+\a{\corona G}$ is equal to…
Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular…
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…
Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…
We introduce an Alexander polynomial for MOY graphs. For a framed trivalent MOY graph $\mathbb{G}$, we refine the construction and obtain a framed ambient isotopy invariant $\Delta_{(\mathbb{G},c)}(t)$. The invariant $\Delta_{(\mathbb{G},…
The existence of non-continuous invariant graphs (or strange non-chaotic attractors) in quasiperiodically forced systems has generated great interest, but there are still very few rigorous results about the properties of these objects. In…
We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…