Even circuits of prescribed clockwise parity

We show that a graph has an orientation under which every circuit of even length is clockwise odd if and only if the graph contains no subgraph which is, after the contraction of at most one circuit of odd length, an even subdivision of K_{2,3}. In fact we give a more general characterisation of graphs that have an orientation under which every even circuit has a prescribed clockwise parity. This problem was motivated by the study of Pfaffian graphs, which are the graphs that have an orientation under which every alternating circuit is clockwise odd. Their significance is that they are precisely the graphs to which Kasteleyn's powerful method for enumerating perfect matchings may be applied

Failure detection and isolation investigation for strapdown skew redundant tetrad laser gyro inertial sensor arrays

The degree to which flight-critical failures in a strapdown laser gyro tetrad sensor assembly can be isolated in short-haul aircraft after a failure occurrence has been detected by the skewed sensor failure-detection voting logic is investigated along with the degree to which a failure in the tetrad computer can be detected and isolated at the computer level, assuming a dual-redundant computer configuration. The tetrad system was mechanized with two two-axis inertial navigation channels (INCs), each containing two gyro/accelerometer axes, computer, control circuitry, and input/output circuitry. Gyro/accelerometer data is crossfed between the two INCs to enable each computer to independently perform the navigation task. Computer calculations are synchronized between the computers so that calculated quantities are identical and may be compared. Fail-safe performance (identification of the first failure) is accomplished with a probability approaching 100 percent of the time, while fail-operational performance (identification and isolation of the first failure) is achieved 93 to 96 percent of the time

Unexpected behaviour of crossing sequences

The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and cr_2(G) = 0. This provides support for a conjecture of Archdeacon et al. and resolves a problem of Salazar.Comment: 21 page

Circuits in graphs embedded on the torus

AbstractWe give a survey of some recent results on circuits in graphs embedded on the torus. Especially we focus on methods relating graphs embedded on the torus to integer polygons in the Euclidean plane