Harmonic Mean Labelling For Some Special Graphs

Main Article Content

K. Dhavamani, N. Rajakumari

Abstract

A graph G=(V,E) with p vertices and q edges is said to be a mean graph if it is possible to label the vertices with distinct elements f(x) from 0,1,2,…..q in such a way that when each edge is labelled with if is even and if is odd, then the resulting edge labels are distinct. is called a mean labelling of G. Here, we investigate the mean labelling of caterpillar, dragon, arbitrary super subdivision of a path and some graphs which are obtained from cycles and stars.

Article Details

How to Cite
K. Dhavamani, N. Rajakumari. (2019). Harmonic Mean Labelling For Some Special Graphs. International Journal on Future Revolution in Computer Science &Amp; Communication Engineering, 5(7), 25–27. Retrieved from https://ijfrcsce.org/index.php/ijfrcsce/article/view/1988
Section
Articles