A characterization problem in graph theory

Aigner, 1968, On the Tetrahedral Graph, Pacific J. Math., 25, 219, 10.2140/pjm.1968.25.219 Bose, 1967, A Characterization of Tetrahedral Graphs, J. Combinatorial Theory, 3, 366, 10.1016/S0021-9800(67)80104-2 Conner, 1958, The Uniqueness of the Triangular Association Scheme, Ann. Math. Stat., 29, 262, 10.1214/aoms/1177706724 Hoffman, 1960, On the Uniqueness of the Triangular Association Scheme, Ann. Math. Stat., 31, 492, 10.1214/aoms/1177705914 Hoffman, 1960, On the Exceptional Case in a Characterization of the Arcs of a Complete Graph, IBM J., 4, 487, 10.1147/rd.45.0487 Li-Chien, 1959, The Uniqueness and Non-uniqueness of the Triangular Association Schemes, Sci. Record, Math. New Ser., 3, 604 Li-chien, 1960, Association Schemes of Partially Balanced Designs with Parameters v=28, n1=12, n2=15 and p11=4, Sci. Record, Math. New Ser., 4, 12 di Paola, 1966, Block Designs and Graph Theory, J. Combinatorial Theory, 1, 132, 10.1016/S0021-9800(66)80010-8 Shrikhande, 1959, A Characterization of the Triangular Association Scheme, Ann. Math. Stat., 30, 39, 10.1214/aoms/1177706357