PROPERTIES OF STRONG COLORINGFOR SOME STANDARD GRAPHS
Main Article Content
Abstract
In graph theory coloring plays a major role. The vertex coloring is an assignment
of colors to the vertices of a graph ‘G’ such that no two adjacent vertices have the same color.
That is, no two vertices of an edge should be of the same color. In this study, strong coloring
for various standard graphs are derived and further using suitable examples the results are
examined.
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.
