Search Results for ""

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...

The (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...

The Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The golden ratio has decimal expansion phi=1.618033988749894848... (OEIS A001622). It can be computed to 10^(10) digits of precision in 24 CPU-minutes on modern hardware and ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...