Colorings, determinants and Alexander polynomials for spatial graphs
From MaRDI portal
Publication:2802907
DOI10.1142/S021821651650019XzbMATH Open1334.05040arXiv1506.06083OpenAlexW2963290082MaRDI QIDQ2802907FDOQ2802907
Authors: Blake Mellor, Terry Kong, Alec Lewald, Vadim Pigrish
Publication date: 27 April 2016
Published in: Journal of Knot Theory and its Ramifications (Search for Journal in Brave)
Abstract: A {em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita cite{ki}), and examine their behavior under some common operations on the graph. We use the Alexander module to define the determinant and -colorings of a balanced spatial graph, and provide examples. We show that the determinant of a spatial graph determines for which the graph is -colorable, and that a -coloring of a graph corresponds to a representation of the fundamental group of its complement into a metacyclic group . We finish by proving some properties of the Alexander polynomial.
Full work available at URL: https://arxiv.org/abs/1506.06083
Recommendations
Cites Work
Cited In (5)
This page was built for publication: Colorings, determinants and Alexander polynomials for spatial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802907)