On Edge Covering Chain of a Graph

Abstract- In the study of domination in graphs, relationships between the concepts of maximal independent sets, minimal dominating sets and maximal irredundant sets are used to establish what is known as domination chain of parameters. 0 ir(G)  (G)  i(G)   (G)  (G)  IR(G) In this paper, starting from the concept of edge cover, six graph theoretic parameters are introduced which obey a chain of inequalities, called as the edge covering chain of the graph G