Related papers: Coloring invariants of spatial graphs

It is well-known that the cohomology of symmetric quandles generates robust cocycle invariants for unoriented classical and surface links. Expanding on the recently introduced module-theoretic generalized cohomology for symmetric quandles,…

We define invariants for colored oriented spatial graphs by generalizing CM invariants, which were defined via non-integral highest weight representations of $U_q(sl_2)$. We apply the same method to define Yokota's invariants, and we call…

Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…

Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…

The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…

In this paper we define novel topological invariants of doubly periodic tangles (DP tangles). DP tangles are embeddings of curves in the thickened plane with translational symmetries in two independent directions. We first organize the…

We define a complete invariant for doodles on a 2-sphere which takes values in series of chord diagrams of certain type. The coefficients at the diagrams with $n$ chords are finite type invariants of doodles of order at most $2n$.

The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods…

We introduce colorings of oriented surface-links by biquasiles using marked graph diagrams. We use these colorings to define counting invariants and Boltzmann enhancements of the biquasile counting invariants for oriented surface-links. We…

Causal graph dynamics are transformations over graphs that capture two important symmetries of physics, namely causality and homogeneity. They can be equivalently defined as continuous and translation invariant transformations or functions…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

It is well known that in a generally covariant gravitational theory the choice of spacetime scalars as coordinates yields phase-space observables (or "invariants"). However their relation to the symmetry group of diffeomorphism…

We show by example that there is a Cayley graph, having two invariant random subgraphs X and Y, such that there exists a monotone coupling between them in the sense that $X\subset Y$, although no such coupling can be invariant. Here,…

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…

The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…

We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maximal stars in a graph. It was introduced in literature in 1985…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…