Search Results for ""

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

The derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...