Search Results for ""

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

A number of the form a_0+a_1zeta+...+a_(p-1)zeta^(p-1), where zeta=e^(2pii/p) is a de Moivre number and p is a prime number. Unique factorizations of cyclotomic integers fail ...

A three-dimensional data set consisting of stacked two-dimensional data slices as a function of a third coordinate.

In the American system, 10^(33).

If q is logically deducible from p, this is written p|-q.

A matrix whose eigenvectors are not complete.

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

A polynomial form which is the sum of two polynomial forms involving separate sets of variables.

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

If lim_(k->infty)u_k!=0, then the series {u_n} diverges.