Near meanness on family of trees
Author & Affiliation:
A. Nellai Murugan
Department of Mathematics, V.O. Chidambaram College, Tuticorin, Tamil Nadu (INDIA)
A. Nagarajan (nagaraja.voc@gmail.com)
Department of Mathematics, V.O. Chidambaram College, Tuticorin, Tamil Nadu (INDIA)
Keyword:
Near mean labeling, Near mean graph.
Issue Date:
December 2010
Abstract:
Let G = (V, E) be a graph with p vertices and q edges and let f: V(G) ® { 0, 1, 2, …., q-1, q+1} be an injection. The graph G is said to have a near mean labeling if for each edge, there exist an induced injective map f*: E(G) ® {1, 2, …., q} defined by
f*(uv) =
The graph that admits a near mean labeling is called a near mean graph (NMG). In this paper, we proved that Family of trees, Bi-star Bn,n, Sub-division Bi-star n,n :W>, Pm
Pages:
775-780
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
A. N. Murugan; A. Nagarajan, "Near meanness on family of trees ", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 3, Page Number 775-780, 2018Copy the following to cite this URL:
A. N. Murugan; A. Nagarajan, "Near meanness on family of trees ", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 3, Page Number 775-780, 2018Available from: https://www.ultrascientist.org/paper/957/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
