{'fraction_non_alphanumeric': 0.01291248206599713, 'fraction_numerical': 0.0, 'mean_word_length': 4.8655462184873945, '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}}
MIS, MVC and MDS in Cyclic Layered Graphs

Graphs are discrete objects with myriad applications in science and engineering. Several graph theoretic problems are shown to be hard. However, for restricted versions of graphs based on the type of restriction the problems that are hard to solve for a general graph become tractable. Layered graphs have been defined and are shown to have applications in social networks and computational molecular biology. We define a new class of graphs called cyclic layered graphs that are related to layered graphs. We pose three problems that can be modeled as graph theoretic problems on cyclic layered graphs. We design efficient algorithms for these problems.