Root Square Mean Labeling (RSML) of New Crown Graphs
R. Abdul Saleem1,  R. Mani2

1R. Abdul Saleem, Assistant Professor, Department of Mathematics, The Quaide Milleth College for Men, Chennai (Tamil Nadu), India.
2R. Mani, Research Scholar, Department of Mathematics, Government Arts College, Chidambaram (Tamil Nadu), India.
Manuscript received on 19 January 2020 | Revised Manuscript received on 02 February 2020 | Manuscript Published on 05 February 2020 | PP: 144-146 | Volume-8 Issue-4S5 December 2019 | Retrieval Number: D10181284S519/2019©BEIESP | DOI: 10.35940/ijrte.D1018.1284S519
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: A graph with a links and b nodes is called RSMG if it is possible to label the links with distinct labels from in such a way that when every node is , then the resulting nodes labels are separate. In this case is called a RSML of In this article we prove that some new crown graphs such as , , are root square mean graphs.
Keywords: Graph, RSML, Path, Cycle, Crown.
Scope of the Article: Cryptography and Applied Mathematics