Search Results for ""

Send a Message

A 1-variable unoriented knot polynomial Q(x). It satisfies Q_(unknot)=1 (1) and the skein relationship Q_(L_+)+Q_(L_-)=x(Q_(L_0)+Q_(L_infty)). (2) It also satisfies ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

A riffle shuffle, in which the top half of the deck is placed in the left hand, and cards are then alternatively interleaved from the left and right hands. Using an ...

The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...