Framed 4-Valent Graphs: Euler Tours, Gauss Circuits and Rotating Circuits

Details Framed 4-Valent Graphs: Euler Tours, Gauss Circuits and Rotating Circuits Framed 4-Valent Graphs: Euler Tours, Gauss Circuits and Rotating Circuits

2009-11-29

arxiv.org/abs/0911.5504v1

Mathematics

Combinatorics

29 pages, 10 figures

Scientific paper

In the present paper we give an explicit formula which allows us immediately to describe a unique Gauss circuit on a framed 4-valent graph (a graph with a structure of opposite edges) from an arbitrary Euler tour on the graph whenever the Gauss circuit exists. This formula only depends on the adjacency matrix of an Euler tour and also tells us whether there exists a Gauss tour on a framed 4-valent graph or not. It turns out that the results are also valid for all symmetric matrices (not just realisable by a chord diagram).

Affiliated with

Also associated with

No associations

Rating

Framed 4-Valent Graphs: Euler Tours, Gauss Circuits and Rotating Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Framed 4-Valent Graphs: Euler Tours, Gauss Circuits and Rotating Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Framed 4-Valent Graphs: Euler Tours, Gauss Circuits and Rotating Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151077