Search Results for ""

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

A graph for which every node has finite degree.

Simple majority vote is the only procedure which is anonymous, dual, and monotonic.

The nth partial numerator in a generalized continued fraction b_0+K_(n=1)^infty(a_n)/(b_n) is the expression a_n. For a simple continued fraction b_0+K_(n=1)^infty1/(b_n), ...

The term "polyedge" has been variously proposed to refer to a polystick or a simple connected graph on n edges (Muñiz 2011), the latter of which has also been termed an ...

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

A ring for which the product of any pair of ideals is zero only if one of the two ideals is zero. All simple rings are prime.

The projective symplectic group PSp_n(q) is the group obtained from the symplectic group Sp_n(q) on factoring by the scalar matrices contained in that group. PSp_(2m)(q) is ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...