|
This article is cited in 4 scientific papers (total in 4 papers)
On the entropy of hereditary classes of colored graphs
V. E. Alekseev, S. V. Sorochan
Abstract:
The results obtained earlier for hereditary classes of ordinary graphs are generalised to hereditary classes of coloured graphs. A coloured graph is a complete ordinary graph with coloured edges. We prove that the smallest positive value of the entropy of hereditary classes of $q$-coloured graphs is equal to
$(1/2)\log_q2$ and characterise the minimal classes with such value of the entropy.
The research was supported by the Russian Foundation for Basic Research, grant 98–01–00792.
Received: 15.07.1999
Citation:
V. E. Alekseev, S. V. Sorochan, “On the entropy of hereditary classes of colored graphs”, Diskr. Mat., 12:2 (2000), 99–102; Discrete Math. Appl., 10:3 (2000), 273–277
Linking options:
https://www.mathnet.ru/eng/dm327https://doi.org/10.4213/dm327 https://www.mathnet.ru/eng/dm/v12/i2/p99
|
Statistics & downloads: |
Abstract page: | 674 | Full-text PDF : | 263 | References: | 54 | First page: | 4 |
|