{'fraction_non_alphanumeric': 0.05359877488514548, 'fraction_numerical': 0.018376722817764167, 'mean_word_length': 3.9545454545454546, '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': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
GEODETIC GAMES FOR GRAPHS

ABSTRACT Let S be a subset of the vertex set V(G) of a nontrivial connected graph G. The geodetic closure (S) of S is the set of all vertices on geodesics between two vertices in S. The first player A chooses a vertex v1 of G. The second player B then picks v2 ≠ v1 and forms the geodetic closure (S2) = ({v1, v2}). Now A selects v3 e V—S2 and forms (S3) = ({v1, v2, v3}), etc. The player who first selects a vertex vn such that (Sn) = V wins the achievement game, but loses the avoidance game. These geodetic achievement and avoidance games are solved for several families of graphs by determining which player is the winner.