Eccentric sequences and triangle sequences of block designs (Q1322213)

The deltagraph of a design \(D\) was defined by the present authors [Graphs versus designs---a quasisurvey; in: Y. Alavi et al. (eds.), Graph theory, combinatorics, and applications, Vol. 1, Proc. 6th Int. Conf., Kalamazoo/MI (USA) 1988, 125-142 (1991)]. The associated so-called eccentric sequences and eccentric sets were defined by \textit{M. Behzad} and \textit{J. E. Simpson} [Discrete Math. 16, 187-193 (1976; Zbl 0364.05034)]. The authors show that only five sets can occur as eccentric set of a deltagraph and demonstrate that four of these actually do occur. Whether \(\{2,3,4\}\) is realizable is an open problem. Other open problems are mentioned. If \(u_ 1,\ldots,u_ p\) are the vertices of a graph \(G\) and \(t(u)\) is the number of distinct triangles in \(G\) with \(u\) as a vertex, then the triangle set \(T(G)\) is the set of distinct \(t(u)\)'s. The triangle sets of the simple underlying graphs of deltagraphs of designs are used to distinguish designs with the same parameters in a number of specific cases (using a PC).