Search Results for ""

The term multigraph refers to a graph in which multiple edges between nodes are either permitted (Harary 1994, p. 10; Gross and Yellen 1999, p. 4) or required (Skiena 1990, ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...

The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

An inverse function of an Abelian integral. Abelian functions have two variables and four periods, and can be defined by Theta(v,tau;q^'; ...

An abstract group is a group characterized only by its abstract properties and not by the particular representations chosen for elements. For example, there are two distinct ...

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...

"Arabic numerals" are the numerical symbols 1, 2, 3, 4, 5, 6, 7, 8, 9, and 0. Historically, Indian numerals evolved in Arab usage roughly 1000 A.D., and there was rare ...