Loading...
Please wait, while we are loading the content...
Similar Documents
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Mousavi, Fatemeh Sadat Noori, Massomeh |
| Copyright Year | 2017 |
| Abstract | Let G be a graph and χaa(G) denotes the minimum number of colors required for an acyclic edge coloring of G in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for χaa(G□H) for any two graphs G and H. We also determine exact value of this parameter for the Cartesian product of two paths, Cartesian product of a path and a cycle, Cartesian product of two trees, hypercubes. We show that χaa(Cm□Cn) is at most 6 fo every m ≥ 3 and n ≥ 3. Moreover in some cases we find the exact value of χaa(Cm□Cn). |
| Starting Page | 19 |
| Ending Page | 30 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| DOI | 10.22108/toc.2017.20988 |
| Volume Number | 6 |
| Alternate Webpage(s) | http://toc.ui.ac.ir/article_20988_dc6050dc4f36dd95fd12e657ff895814.pdf |
| Alternate Webpage(s) | https://doi.org/10.22108/toc.2017.20988 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
