Abstract
Let G = (V, E) be a simple graph and : V {1, 2, ... | V |} be a bijection, for each edge uv assigned the label 1 if is odd and 0 if is even. is called quotient square sum cordial labeling if | (0) − (1)| ≤ 1, where (0) and (1) denote the number of edges labeled with 0 and labeled with 1 respectively. A graph which admits a quotient square sum cordial labeling is called quotient square sum cordial graph. In this paper path Pn, cycle Cn, star K1,n , friendship graph Fn , bistar Bn,n , C4 ∪ Pn ,Km,2 and Km,2 ∪ Pn are shown to be quotient square sum 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 callMore From: International Journal of Recent Technology and Engineering
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.
