Abstract
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V tof1;2;:::;j Vjg such that if each edge uv is assigned the label -1 ifj[f (u)] 2 [f (v)] 2 j 1(mod4), the label 0 ifj[f (u)] 2 [f (v)] 2 j 0(mod4) and the label 1 ifj[f (u)] 2 [f (v)] 2 j 1(mod4), then the number of edges labeled with i and the number of edges labeled with j differ by atmost 1 for 1 i;j 1. If a graph has a square difference 3-equitable labeling, then it is called square difference 3-equitable graph. In this paper, we investigate the square difference 3-equitable labeling behaviour of middle graph of paths, fan graphs, (P2n;S1), mK3, triangular snake graphs and friendship graphs.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
