- Title
- Equivalence dominating sets in graphs
- Creator
- Arumugam, S.; Sundarakannan, M.
- Relation
- Utilitas Mathematica Vol. 91, p. 231-242
- Publisher
- University of Manitoba
- Resource Type
- journal article
- Date
- 2013
- Description
- Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the induced subgraph (S) is complete. In this paper we introduce several parameters using equivalence sets and discuss their relation with other graph theoretic parameters.
- Subject
- domination; irredundance; equivalence sets; equivalence domination; equivalence irredundance
- Identifier
- http://hdl.handle.net/1959.13/1296912
- Identifier
- uon:19330
- Identifier
- ISSN:0315-3681
- Language
- eng
- Reviewed
- Hits: 723
- Visitors: 714
- Downloads: 0