Abstract
A function from the vertex set of a graph G to the set {0,1,2} is called 3-equitable labeling if the induced edge labels are produced by the absolute difference of labels of end vertices such that the absolute difference of number of vertices of G labeled with 0, 1 and 2 differ by at most 1 and similarly the absolute difference of number of edges of G labeled with 0, 1 and 2 differ by at most 1. In this paper we discuss 3-equitable labeling in context of barycentric subdivision of cycle with one chord, cycle with twin chords, cycle with triangle, shell graph and wheel graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics and Soft Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
