- Title
- The equivalence chain of a graph
- Creator
- Arumugam, S.; Sundarakannan, M.
- Relation
- Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 80, p. 277-288
- Relation
- http://www.combinatorialmath.ca/jcmcc/jcmcc80.html
- Publisher
- Charles Babbage Research Centre
- Resource Type
- journal article
- Date
- 2012
- 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 starting with the concept of equivalence set as seed property, we form an inequality chain of six parameters, which we call the equivalence chain of G. WE present several basic results on these parameters and problems for further investigation.
- Subject
- domination; independence; irredundance; equivalence set
- Identifier
- http://hdl.handle.net/1959.13/1308620
- Identifier
- uon:21683
- Identifier
- ISSN:0835-3026
- Language
- eng
- Reviewed
- Hits: 531
- Visitors: 592
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|