Abstract
A Mean Square Cordial Labeling (MSCL) of a Graph G(V, E) with p vertices and q edges is a bijection from V to {0, 1} such that each edge uv is assigned the label where ⌈x⌉ (ceil( x)) is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled 0 and the number of edges labeled with 1 differ by at most 1. In this paper it is analyzed that some star related graphs like Bistar graph B(k, k), Subdivision of a star graph S(Sk), Coconut tree CT(k, k), Merge graph Ck*Sk,, Graph PmΘ K1, n and Banana tree BT(k, k) admits mean square cordial labeling.
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.
