Search Results for ""

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

Consider an infinite repository containing balls of n different types. Then the following table summarizes the number of distinct ways in which k balls can be picked for four ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...