Coding the Vertices of a Graph with Rosenbloom-Tsfasman Metric

被引：0
|
作者：
Rajkumar, R. [1 ]
机构：
[1] Deemed Univ, Gandhigram Rural Inst, Dept Math, Gandhigram 624302, Tamil Nadu, India
来源：
MATHEMATICAL MODELLING AND SCIENTIFIC COMPUTATION | 2012年 / 283卷
关键词：
Coding; Graphs; Rosenbloom-Tsfasman distance; Hamming distance;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we study the codability of graphs with respect to the Rosenbloom-Tsfasman metric. The possibilities of coding the vertices of connected graphs and disconnected graphs with this metric have been analyzed. Some comparisions between the codability of graphs with Ftosenbloom-Tsfasman metric and Hamming metric have been made.
引用
收藏
页码：97 / 103
页数：7
相关论文
共 50 条
12345