{'fraction_non_alphanumeric': 0.020202020202020204, 'fraction_numerical': 0.021464646464646464, 'mean_word_length': 4.962406015037594, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Computer algebra investigation of known primitive triangle-free strongly regular graphs

With the aid of computer algebra systems COCO and GAP with its packages we are investigating all seven known primitive triangle-free strongly regular graphs on 5, 10, 16, 50, 56, 77 and 100 vertices. These graphs are rank 3 graphs, having a rich automorphism group. The embeddings of each graph from this family to other ones are described, the automorphic equitable partitions are classied, all equitable partitions in the graphs on up to 50 vertices are enumerated. Basing on the reported computer aided results and using techniques of coherent congurations, a few new models of these graphs are suggested, which are relying on knowledge of just a small part of symmetries of a graph in consideration.