TOPICS
Search

Search Results for ""


1041 - 1050 of 2735 for Corona Graph ProductSearch Results
A simple pole of an analytic function f is a pole of order one. That is, (z-z_0)f(z) is an analytic function at the pole z=z_0. Alternatively, its principal part is c/(z-z_0) ...
If the top and bottom bases of a solid are equal in area, lie in parallel planes, and every section of the solid parallel to the bases is equal in area to that of the base, ...
An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.
A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.
A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...
A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...
The q-analog of the Pochhammer symbol defined by (a;q)_k={product_(j=0)^(k-1)(1-aq^j) if k>0; 1 if k=0; product_(j=1)^(|k|)(1-aq^(-j))^(-1) if k<0; ...
A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...
An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...
A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...
1 ... 102|103|104|105|106|107|108 ... 274 Previous Next

...