Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Nikita Alexandrovich Kuzmin"'
Publikováno v:
Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications".
The paper completely describes connected (n,n+3)-graphs of maximal degree 3, which have the largest number of matchings.
Autor:
Nikita Alexandrovich Kuzmin
Publikováno v:
Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications".
In this paper, we consider and completely solve the problem maximizing the number of matchings in trees of diameter 5 with a given the number of peaks.