Search Results for ""

The connective in A<=>B (also denoted A=B) that returns a true result iff A and B are either both true or both false. The biconditional is also called an equivalence.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A concordance between knots K_0 and K_1 in S^3 is a locally flat cylinder C=S^1×[0,1] embedded in S^3×[0,1] in such a way that the ends S^1×{1} are embedded in S^3×{i} as ...

The formal term in propositional calculus for the connective implies.

The slicing of a three-dimensional object by a plane (or more general slice).

Given the direct sum of additive Abelian groups A direct sum B, A and B are called direct summands. The map i_1:A-->A direct sum B defined by i(a)=a direct sum 0 is called ...

The term in logic used to describe the operation commonly known as OR. A literal is considered a (degenerate) disjunction (Mendelson 1997, p. 30). The Wolfram Language ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

Edge splitting is the reverse of edge contraction.