Tree Related Sign Graph

  • Dr. A NellaiMurugan College Tuticorin
  • R Mahalakshmi College Tuticorin
Keywords: tree, Subdivided star, sign graph 2000 Mathematics Subject classification 05C78.

Abstract

Let G= (V,E) be a graph with p vertices and q edges. Let f:V(G){-1,1} be a map. The graph G is to have a sign graph labeling if for the edge e=uv, the induced edge labeling f*:E(G){-,+} is given by f*(e)=f (u)*f(v).With the condition that the number of vertices labeled with -1 and the number of vertices labeled with 1 differby atmost 1 and the number of edges labeled with 1 and the number of edges labeled with-1 differ atmost 1.The graph that admits aSign Labelling is called Sign Graph. In this paper, we proved that cycle related graphs tree , Subdivided star < span style="font-family: Times New Roman,Italic;font-size:9pt;color:rgb(0,0,0);font-style:normal;font-variant:normal;">,∶ n >, Tree - ��� , K3,n related graphs are Analytic Mean Cordial Graphs.

Author Biographies

Dr. A NellaiMurugan, College Tuticorin

Department of Mathematics V.O.Chidambaram College Tuticorin 628008


R Mahalakshmi, College Tuticorin

Department of Mathematics V.O.Chidambaram College Tuticorin 628008


Published
2016-10-31
How to Cite
NellaiMurugan, D. A., & Mahalakshmi, R. (2016, October 31). Tree Related Sign Graph. EPH - International Journal of Mathematics and Statistics (ISSN: 2208-2212), 2(10), 01-08. Retrieved from https://ephjournal.com/index.php/ms/article/view/6