AMS classifications: 05E30; 05B20; 94B05

In this and a sequel paper [10] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize 2-(v, k, É) designs, and include partial geometric designs and uniform multiplicative designs.Here we study the latter, which are precisely the nonsingular...

In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize (v, k, ë) designs, and include uniform multiplicative designs and partial geometric designs.Here we study the latter, which are precisely the designs with...

We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.

We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair of subgraphs) in a graph in terms of polynomials and the spectrum of the graph. We find properties of the polynomial optimizing the bound. Explicit bounds on the number of vertices at maximal...

A graph G has constant u = u(G) if any two vertices that are not adjacent have u common neighbours. G has constant u and u if G has constant u = u(G), and its complement G has constant u = u(G). If such a graph is regular, then it is strongly regular, otherwise precisely two vertex degrees...

We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2, and give new infinite families of examples.

For most feasible spectra of connected regular graphs with four distinct eigenvalues and at most 30 vertices we find all such graphs, using both theoretic and computer results.

AMS classifications: 05E30; 05B20

2010 Mathematics Subject Classification: 05E30, 05C50;