Proceedings of the First International Conference on Computing, Communication and Control System, I3CAC 2021, 7-8 June 2021, Bharath University, Chennai, India

Research Article

Mean Square Cordial Labeling Of Some Pentagonal Snake Graphs

Download51 downloads
  • @INPROCEEDINGS{10.4108/eai.7-6-2021.2308859,
        author={S  Dhanalakshmi and S.  Thirunavukkarasu},
        title={Mean Square Cordial Labeling Of Some Pentagonal Snake Graphs},
        proceedings={Proceedings of the First International Conference on Computing, Communication and Control System, I3CAC 2021, 7-8 June 2021, Bharath University, Chennai, India},
        publisher={EAI},
        proceedings_a={I3CAC},
        year={2021},
        month={6},
        keywords={mean square cordial labeling pentagonal snake s(psk ) double pentagonal snake d(psk) alternate pentagonal snake  a(psk)},
        doi={10.4108/eai.7-6-2021.2308859}
    }
    
  • S Dhanalakshmi
    S. Thirunavukkarasu
    Year: 2021
    Mean Square Cordial Labeling Of Some Pentagonal Snake Graphs
    I3CAC
    EAI
    DOI: 10.4108/eai.7-6-2021.2308859
S Dhanalakshmi1,*, S. Thirunavukkarasu2
  • 1: Department of Mathematics, Faculty of Engineering and Technology, SRM IST, Chennai -600089, India
  • 2: Department of Information Technology, Faculty of Engineering and Technology, BIHER, Chennai -600073, India
*Contact email: dhanalas1@srmist.edu.in

Abstract

The A Mean Square Cordial labeling of a Graph G(V,E) with p vertices and q edges is an onto from V to {0, 1} such that each edge uv is assigned the label where (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 we analysed that Pentagonal snake PSk, Subdivision of a pentagonal snake S(PSk ) ,Double pentagonal snake D(PSk) and Alternate pentagonal snake A(PSk) are mean square cordial graphs.