Equitable Coloring On Rooted Product Of Graphs
Main Article Content
Abstract
A finite and simple graph is said to be equitably colorable if its vertices can be partitioned into classes such that each is an independent set and holds for every . The smallest integer for which is equitable chromatic number of and denoted by . The equitable chromatic threshold of a graph , denoted by , is the minimum such that is equitably colorable for all . This paper focuses on the equitable colorability of rooted product of graphs, in particular, exact values or upper bounds of and when and are cycles, paths, complete graphs and complete partite graphs have been found.
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
