A Polynomial Invariant Of Twisted Graph Diagrams
Abstract
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2007
- DOI:
- 10.48550/arXiv.0706.2854
- arXiv:
- arXiv:0706.2854
- Bibcode:
- 2007arXiv0706.2854U
- Keywords:
-
- Mathematics - Geometric Topology;
- Mathematics - Combinatorics;
- 57M25;
- 05C10
- E-Print:
- 22 pages