A characterization of the Tm graph

Journal of Combinatorial Theory - Tập 6 - Trang 251-263 - 1969
Thomas A. Dowling1
1Department of Statistics, University of North Carolina, Chapel Hill, North Carolina 27514 USA

Tài liệu tham khảo

Aigner, 1969, A Characterization Problem in Graph Theory, J. Combinatorial Theory, 6, 45, 10.1016/S0021-9800(69)80104-3 Bose, 1967, A Characterization of Tetrahedral Graphs, J. Combinatorial Theory, 3, 366, 10.1016/S0021-9800(67)80104-2 Connor, 1958, The Uniquencess of the Triangular Association Scheme, Ann. Math. Statist., 29, 262, 10.1214/aoms/1177706724 Hoffman, 1960, On the Uniquencess of the Triangular Association Scheme, Ann. Math. Statist., 31, 492, 10.1214/aoms/1177705914 Hoffman, 1960, On the Exceptional Case in a Characterization of the Arcs of a Complete Graph, IBM J. Res. Develop., 4, 492, 10.1147/rd.45.0487 Hoffman, 1960, On the Exceptional Case in a Characterization of the Arcs of a Complete Graph, IBM J. Res. Develop., 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 p112=4, Sci. Record, Math. New Ser., 4, 12 Shrikhande, 1959, On a Characterization of the Triangular Association Scheme, Ann. Math. Statist., 30, 39, 10.1214/aoms/1177706357