Article
Odd mean labeling for two star graph
Authors
, and
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.
Keywords
Odd mean graph, path and star, 05C78
Citation
Sudhakar, S., Francis, S., & Balaji, V. (2017). Odd mean labeling for two star graph. Applied Mathematics and Nonlinear Sciences, 2(1), 195–200. https://doi.org/10.21042/AMNS.2017.1.00016
S. Sudhakar, S. Francis and V. Balaji, “Odd mean labeling for two star graph,” Applied Mathematics and Nonlinear Sciences, vol. 2, no. 1, pp. 195–200, 2017, doi: 10.21042/AMNS.2017.1.00016.
Sudhakar S, Francis S, Balaji V. Odd mean labeling for two star graph. Applied Mathematics and Nonlinear Sciences. 2017;2(1):195–200. doi:10.21042/AMNS.2017.1.00016.
Sudhakar, S., Francis, S. and Balaji, V. (2017), ‘Odd mean labeling for two star graph’, Applied Mathematics and Nonlinear Sciences, 2(1), pp. 195–200. Available at: https://doi.org/10.21042/AMNS.2017.1.00016.
Sudhakar, S., et al. “Odd Mean Labeling for Two Star Graph.” Applied Mathematics and Nonlinear Sciences, vol. 2, no. 1, 2017, pp. 195–200. https://doi.org/10.21042/AMNS.2017.1.00016.
Sudhakar, S., Silviya Francis, and V. Balaji. “Odd Mean Labeling for Two Star Graph.” Applied Mathematics and Nonlinear Sciences 2, no. 1 (2017): 195–200. https://doi.org/10.21042/AMNS.2017.1.00016.
Export citation
Published by: Engineering Journals
