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 ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

Three elements x, y and z of a set S are said to be associative under a binary operation * if they satisfy x*(y*z)=(x*y)*z. (1) Real numbers are associative under addition ...

Two elements x and y of a set S are said to be commutative under a binary operation * if they satisfy x*y=y*x. (1) Real numbers are commutative under addition x+y=y+x (2) and ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).