Search Results for ""

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...

The secant numbers S_k, also called the zig numbers or the Euler numbers E_n^*=|E_(2n)| numbers than can be defined either in terms of a generating function given as the ...

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

A lattice polygon consisting of a closed self-avoiding walk on a square lattice. The perimeter, horizontal perimeter, vertical perimeter, and area are all well-defined for ...

A partition whose conjugate partition is equivalent to itself. The Ferrers diagrams corresponding to the self-conjugate partitions for 3<=n<=10 are illustrated above. The ...

A separating family is a set of subsets in which each pair of adjacent elements are found separated, each in one of two disjoint subsets. The 26 letters of the alphabet can ...

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, ...

A connected graph having e graph edges is said to be sequential if it is possible to label the nodes i with distinct integers f_i in {0,1,2,...,e-1} such that when graph edge ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...