<abstract xmlns="http://www.w3.org/1999/xhtml">In this paper further result on odd mean labeling is discussed. We prove that the two star <italic>G</italic> = <italic>K</italic>1,<italic>m</italic> ∧ <italic>K</italic>1,<italic>n</italic> is an odd mean graph if and only if |<italic>m</italic> − <italic>n</italic>| ≤ 3. The condition for a graph to be odd mean is that <italic>p</italic> ≤ <italic>q</italic> + 1, where <italic>p</italic> and <italic>q</italic> stands for the number of the vertices and edges in the graph respectively.</abstract>

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.

Odd mean labeling for two star graph

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Odd mean labeling for two star graph"}

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...

Odd mean labeling for two star graph

Publié en ligne: 20 juin 2017

Pages: 195 - 200

Reçu: 06 janv. 2017

Accepté: 20 juin 2017

DOI: https://doi.org/10.21042/AMNS.2017.1.00016

Mots clés
Odd mean graph, path and star

© 2017 S. Sudhakar, Silviya Francis, and V. Balaji, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Odd mean labeling for two star graph

Publié en ligne: 20 juin 2017

Pages: 195 - 200

Reçu: 06 janv. 2017

Accepté: 20 juin 2017

DOI: https://doi.org/10.21042/AMNS.2017.1.00016

Mots clésOdd mean graph, path and star

© 2017 S. Sudhakar, Silviya Francis, and V. Balaji, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
Odd mean graph, path and star