| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423371 | Discrete Mathematics | 2014 | 5 Pages |
Abstract
In Matula (1968), D.W. Matula described a bijection between N and the set of rooted trees; the number is called the Matula number of the rooted tree. The Gutman-IviÄ-Matula (GIM)Â function g(n) computes the number of edges of the tree with Matula number n. Since there is a prefix-free code for the set of prime numbers such that the codelength of each prime p is 2g(p), we show how some results about the GIM function can be obtained trivially from coding theorems.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Albert Burgos,