|
This article is cited in 6 scientific papers (total in 6 papers)
Partial ordering of trees and the classification of connected graphs and blocks
G. I. Kalmykov
Abstract:
The article consists of two parts. In the first part, partial ordering of trees and the notion of the spanning tree of a connected graph are introduced, and, on the basis of the last one, a classification of connected graphs is given. In the second part, the notion of spanning tree of a block is introduced and, on its basis, a classification of blocks is given. The obtained results have applications to statistical mechanics. Most of them have been announced in the recent article of the author [Teor. Mat. Fiz. 84, No. 2, 279–289 (1990)].
Received: 11.11.1990
Citation:
G. I. Kalmykov, “Partial ordering of trees and the classification of connected graphs and blocks”, Diskr. Mat., 4:2 (1992), 66–73
Linking options:
https://www.mathnet.ru/eng/dm732 https://www.mathnet.ru/eng/dm/v4/i2/p66
|
Statistics & downloads: |
Abstract page: | 305 | Full-text PDF : | 125 | First page: | 4 |
|