We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries their generalizations or elliptic semiplanes are constructed. Necessary existence conditions proved a table of feasible parameters at most 200 points is presented. Non-existence some proved.

In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.

The statistical properties for bicoherence estimation are shown to be strongly connected to the properties of the powerand bispectral estimator used. Data tapering will reduce spectral leakage and frequency smoothing will reduce the variance. It is shown that correct normalization is essential to ensure unbiased results. The multitaper approach is shown to be superior to other non-parametric es...