TOPICS
Search

Search Results for ""


1 - 10 of 95 for RC circuitSearch Results
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.
A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...
The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...
A k-chain whose bounding (k-1)-chain vanishes.
A graphoid consists of a set M of elements together with two collections C and D of nonempty subsets of M, called circuits and cocircuits respectively, such that 1. For any C ...
A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...
An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...
The nullity of a linear transformation f:V->W of vector spaces is the dimension of its null space. The nullity and the map rank add up to the dimension of V, a result ...
The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...
The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...
1|2|3|4 ... 10 Next

...