Abstract
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 Rosenbloom-Tsfasman metric and Hamming metric have been made.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breuer, M.A.: Coding the vertexes of a graph. IEEE Trans. Inform. Theory IT-12(2), 148–153 (1966)
Breuer, M.A., Folkman, J.: An unexpected result in coding the vertices of a graph. J. Math. Anal. Appl. 20, 583–600 (1967)
Rosenbloom, M.Y., Michael, A.: Tsfasman: Codes for the m-metric. Probl. Inf. Trans. 33, 55–63 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajkumar, R. (2012). Coding the Vertices of a Graph with Rosenbloom-Tsfasman Metric. In: Balasubramaniam, P., Uthayakumar, R. (eds) Mathematical Modelling and Scientific Computation. ICMMSC 2012. Communications in Computer and Information Science, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28926-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-28926-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28925-5
Online ISBN: 978-3-642-28926-2
eBook Packages: Computer ScienceComputer Science (R0)