Abstract

The labeling of a graph, we mean assign some integers to the vertices or edges (or both) of the graph. Here the vertices of the graph are labeled with oblong numbers and the edges are labeled with mean of the end vertex labels. Here the greatest common incidence number (gcin) of a vertex of degree greater than one is defined as the greatest common divisor of the labels of the incident edges. If the gcin of each vertex of degree greater than one is 1, then the graph admits oblong mean prime labeling. Here we characterize some tree graphs for oblong mean prime labeling. Sunoj B S | Mathew Varkey T K"Oblong Mean Prime Labeling of Some Tree Graphs" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-2 , February 2018, URL: http://www.ijtsrd.com/papers/ijtsrd8375.pdf http://www.ijtsrd.com/mathemetics/combinatorics/8375/oblong-mean-prime-labeling-of-some-tree-graphs/sunoj-b-s

Authors and Affiliations