Beam search for integral graphs of diameter four with many distinct star sizes, v2

This collection contains three files:Python code implementing beam search for pairs of interlacing sequences (m[1]..m[s]), (u[1],..,u[s-1]) which yield integral trees of diameter four with star sizes m[1]^2..m[s]^2,Final results obtained by extending sequences previously reported by Wang, Wang and Huo [Appl. Math. Comput. 282 (2016), 53-62],Python code verifying that lengthy integers reported in final results really do satisfy necessary conditionsThis is supplementary material to the paper "On integral trees of diameter four built from stars of many distinct sizes", written jointly with Dragan Stevanović, which has been submitted for publication.