EQUIVALENCE DOMINATING SETS IN GRAPHS

作者：Arumugam S^*; Sundarakannan M

来源：Utilitas Mathematica, 2013, 91: 231-242.

• Domination
• irredundance
• equivalence sets
• equivalence domination
• equivalence irredundance

Let G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the induced subgraph %26lt; S %26gt; is complete. In this paper we introduce several parameters using equivalence sets and discuss their relation with other graph theoretic parameters.

• 出版日期2013-7