{'fraction_non_alphanumeric': 0.007662835249042145, 'fraction_numerical': 0.0, 'mean_word_length': 5.030769230769231, '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}}
Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path

The minimum linear arrangement of an arbitrary graph is the embedding of the vertices of the graph onto the line topology in such a way that the sum of the distances between adjacent vertices in the graph is minimized. This minimization can be attained by finding an optimal ordering of the vertex set of the graph and labeling the vertices of the line in that order. In this paper, we compute the minimum linear arrangement of the Cartesian product of certain sequentially optimal order graphs which include interconnection networks such as hypercube, folded hypercube, complete Josephus cube and locally twisted cube with path and the edge faulty counterpart of sequentially optimal order graphs.