Related papers: Coloring invariants of spatial graphs

A space curve is determined by conformal arc-length, conformal curvature, and conformal torsion, up to M\"obius transformations. We use the spaces of osculating circles and spheres to give a conformally defined moving frame of a curve in…

We consider closed and orientable immersed hypersurfaces of translational manifolds. Given a vector field on such a hypersurface, we define a perturbation of its Gauss map, which allows us to obtain topological invariants for the immersion…

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

K. Cho and S. Nelson introduced the notion of a quandle coloring quiver, which is a quiver-valued link invariant, and a quandle cocycle quiver which is an enhancement of the quandle coloring quiver by assigning to each vertex a weight…

In loop quantum gravity, states of quantum geometry are represented by classes of knotted graphs, equivalent under diffeomorphisms. Thus, it is worthwhile to enumerate and distinguish these classes. This paper looks at the case of 4-regular…

We generalize the index polynomial invariant to the case of virtual tangles. Three polynomial invariants result from this generalization; we give a brief overview of their definition and some basic properties.

We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.

We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…

We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…

By 2-twist-spinning the knotted graph that represents the knotted handlebody $5_2$, we obtain a knotted foam in 4-dimensional space with a non-trivial quandle cocycle invariant.

We define an operation of jets on graphs inspired by the corresponding notion in commutative algebra and algebraic geometry. We examine a few graph theoretic properties and invariants of this construction, including chromatic numbers,…

We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…

Let $G_1$ and $G_2$ be two simple connected graphs. The invariant \textit{coronal} of graph is used in order to determine the $\alpha$-eigenvalues of four different types of graph equations that are $G_1 \circ G_2, G_1\lozenge G_1$ and the…

Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create…

A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…

We define a quandle variety as an irreducible algebraic variety $Q$ endowed with an algebraically defined quandle operation $\rhd$. It can also be seen as an analogue of a generalized affine symmetric space or a regular $s$-manifold in…

Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…

We present different ways of endowing a particular category of graphs with Quillen model structures. We show, among other things, that the core of a graph can be seen as its homotopy type in an appropriate Quillen model structure, and that…

A \emph{directional labeling} of an edge $\emph{uv}$ in a graph $G=(V,E)$ by an ordered pair $ab$ is a labeling of the edge $uv$ such that the label on $uv$ in the direction from $u$ to $v$ is $\ell(uv)=ab$, and $\ell(vu)=ba$. New…

In this report, we describe a novel graph invariant for computational graphs (colored directed acylic graphs) and how we used it to generate all distinct computational graphs up to isomorphism for small graphs. The algorithm iteratively…