| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903444 | Electronic Notes in Discrete Mathematics | 2017 | 8 Pages |
Abstract
An edge irredundant coloring of a graph G = (V, E) is an edge partition â={E1,E2,â¦,Ek} of E into nonempty edge irredundant sets. The edge irratic number is the minimum order of an edge irredundant coloring of G and it is denoted by Ïirâ²(G). In this paper a study has been initiated on edge irredundant coloring of G. We have characterized all graphs G for which Ïirâ²(G)=m or mâ1, where m is the size of a graph G. Also we have obtained some bounds on Ïirâ² for triangle-free graphs and trees.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
K. Raja Chandrasekar, A. Mohammed Abid,