文章基本信息

标题：Radio mean labeling of a graph
本地全文：下载
作者：R. Ponraj ; S. Sathish Narayanan ; R. Kala 等
期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2015
卷号：12
期号：2-3
页码：224-228
DOI：10.1016/j.akcej.2015.11.019
语种：English
出版社：Elsevier
摘要：AbstractA Radio Mean labeling of a connected graphGis a one to one mapffrom the vertex setV(G)to the set of natural numbersNsuch that for two distinct verticesuandvofG,d(u,v)+⌈f(u)+f(v)2⌉≥1+diam(G). The radio mean number off,rmn(f), is the maximum number assigned to any vertex ofG.The radio mean number ofG,rmn(G)is the minimum value ofrmn(f)taken over all radio mean labelingsfofG. In this paper we find the radio mean number of graphs with diameter three, lotus inside a circle, Helms and Sunflower graphs.
关键词：KeywordsenRadio labelingDiameterWheelHelms