Analyzing the regularity of complete k-partite graph using super strongly perfect graphs
R. Mary Jeya Jothi, Ebin Ephrem Elavathingaln · 2015
A graph G is super strongly perfect if every induced subgraph H of G possesses a minimal dominating set that meets all the maximal cliques of H. A regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree. A regular graph with vertices of degree k is called a k-regular graph. Regularity of graphs plays an important role in communication networks. Super strongly perfect graph's structure includes even cycles (which is 2 — regular). In this line of thought, a discussion on the regularity of complete k-partite graph is given using super strongly perfect graph.