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
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
