{'fraction_non_alphanumeric': 0.026119402985074626, 'fraction_numerical': 0.0, 'mean_word_length': 4.875912408759124, '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}}
Rank‐tolerance graph classes

In this article we introduce certain classes of graphs that generalize ϕ‐tolerance chain graphs. In a rank‐tolerance representation of a graph, each vertex is assigned two parameters: a rank, which represents the size of that vertex, and a tolerance which represents an allowed extent of conflict with other vertices. Two vertices are adjacent if and only if their joint rank exceeds (or equals) their joint tolerance. This article is concerned with investigating the graph classes that arise from a variety of functions, such as min, max, sum, and prod (product), that may be used as the coupling functions ϕ and ρ to define the joint tolerance and the joint rank. Our goal is to obtain basic properties of the graph classes from basic properties of the coupling functions.