Such a graph is the point-block incidence graph of a square 2-(16,6,2) design. But Hussain found that there are precisely three such designs, all of them self-dual.
Since blocks meet in two points, if we fix a block B then for each point x outside, the blocks on x determine edges on B, so that x determines a graph on B, regular of degree 2, that is, a union of polygons. These graphs are called Hussain chains. On 6 points the only possibilities for Hussain chains are 3+3 (two triangles), or 6 (a hexagon). Each path of length two on B is in a unique Hussain chain, so in order to describe the design it suffices to give the hexagons - then the paths of length two not covered yet are in triangles. The three designs all have a transitive group (so that the choice of B does not matter), and are characterized by having 0, 4 or 6 hexagons on B. Here 0 occurs for the folded 6-cube.
The second design can be described in terms of the generalized quadrangle GQ(2,2), with as points the pairs from a 6-set, and as lines the partitions of the 6-set into three pairs. Fix a line L. It is on four dual hyperbolic lines (triples of disjoint lines in a 3x3 grid) {L,M,N}. Each of the four pairs {M,N} determines six points of the GQ(2,2), that is, six edges (forming a hexagon) of the 6-set. Take these four hexagons to construct the second design. This construction shows that the stabilizer of B has order 6!/15 = 48.
The third design, described in a similar way: Fix a point P and a cyclic order (L,M,N) on the three lines on P. We find six hexagons by taking, for each ordered pair (L,M), (M,N), (N,L), the two dual hyperlines on the first element that have the second element as transversal. This construction shows that the stabilizer of B has order 6!/(15.2) = 24.
Q. M. Hussain, On the totality of solutions for the symmetrical incomplete block designs: λ=2, k=5 or 6, Sankhya 7 (1945) 204-208.
[BCN], Theorem 9.2.7.