- Title
- Irredundant and open irredundant colorings of graphs
- Creator
- Arumugam, S.; Chandrasekar, K. Raja; Sudha, S.
- Relation
- Bulletin of The Institute of Combinatorics & Its Applications Vol. 61, p. 24-36
- Relation
- http://www.combinatorialmath.ca/ICA
- Publisher
- The Institute of Combinatorics & Its Applications
- Resource Type
- journal article
- Date
- 2011
- Description
- An irredundant( open irredundant) coloring of a graph G = (V, E) is a partition of V(G) into irredundant(open irredundant) sets. The irratic number Xir(G) (open irratic number Xoir(G)of a graph G equals the minimum order of an irredundant (open irredundant) coloring of G. In this paper we present several results on these two parameters.
- Subject
- domination; independence; irredundance; irredundant coloring; open irredundant coloring
- Identifier
- http://hdl.handle.net/1959.13/1036079
- Identifier
- uon:13205
- Identifier
- ISSN:1183-1278
- Language
- eng
- Reviewed
- Hits: 1980
- Visitors: 1944
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|