Odd mean labeling for two star graph

• Autores: S. Sudhakar, Silviya Francis, V. Balaji
• Localización: Applied Mathematics and Nonlinear Sciences, ISSN-e 2444-8656, Vol. 2, Nº. 1, 2017, págs. 195-200
• Idioma: inglés
• DOI: 10.21042/amns.2017.1.00016
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper further result on odd mean labeling is discussed. We prove that the two star G=K1,m∧K1,n is an odd mean graph if and only if |m−n|≤3. The condition for a graph to be odd mean is that p≤q+1, where p and q stands for the number of the vertices and edges in the graph respectively.