The Problem of the Existence of a Tree with a Characteristic Vector of Node Vertices
Main Article Content
Abstract
The paper presents the problem of the existence of a tree with certain numerical characteristics. It is clear that if a tree is given, it is possible to determine the number of node vertices of the tree and leaves, as well as to determine their degrees. Thus, for a tree, you can define a set of pairs whose coordinates are numbers corresponding to the number of node vertices and their degrees. We can form the inverse problem: we give pairs of natural numbers whose second coordinates are greater than 1, and we should determine whether there is at least one tree that the numbers of its node vertices and their degrees coincide with these pairs. The solution to this problem is presented in this paper.
Keywords:
Article Details
References
2. Калужнин Л.А., Сущанский В.И. Преобразования и перестановки. М.: Наука. Главная редакция физико-математической литературы, 1985. 160 с.
3. Нефедов В.Н., Осипова В.А. Курс дискретной математики. М.: Изд-во МАИ, 1992. 264 с.
4. Попов И.Н, Попова А.В. Разложение подстановок в циклы: реализация приложений с помощью Python // Сборник трудов Международной научной конференции «Актуальные проблемы прикладной математики, информатики и механики», Воронеж, Россия, 11-13 ноября 2019 г. Воронеж: Издательство «Научно-исследовательские публикации», 2020. С. 484-491.
5. Lutz M. Learning Python, 4th Edition. O'Reilly Media, Inc. 2011. 1280 p.
Presenting an article for publication in the Russian Digital Libraries Journal (RDLJ), the authors automatically give consent to grant a limited license to use the materials of the Kazan (Volga) Federal University (KFU) (of course, only if the article is accepted for publication). This means that KFU has the right to publish an article in the next issue of the journal (on the website or in printed form), as well as to reprint this article in the archives of RDLJ CDs or to include in a particular information system or database, produced by KFU.
All copyrighted materials are placed in RDLJ with the consent of the authors. In the event that any of the authors have objected to its publication of materials on this site, the material can be removed, subject to notification to the Editor in writing.
Documents published in RDLJ are protected by copyright and all rights are reserved by the authors. Authors independently monitor compliance with their rights to reproduce or translate their papers published in the journal. If the material is published in RDLJ, reprinted with permission by another publisher or translated into another language, a reference to the original publication.
By submitting an article for publication in RDLJ, authors should take into account that the publication on the Internet, on the one hand, provide unique opportunities for access to their content, but on the other hand, are a new form of information exchange in the global information society where authors and publishers is not always provided with protection against unauthorized copying or other use of materials protected by copyright.
RDLJ is copyrighted. When using materials from the log must indicate the URL: index.phtml page = elbib / rus / journal?. Any change, addition or editing of the author's text are not allowed. Copying individual fragments of articles from the journal is allowed for distribute, remix, adapt, and build upon article, even commercially, as long as they credit that article for the original creation.
Request for the right to reproduce or use any of the materials published in RDLJ should be addressed to the Editor-in-Chief A.M. Elizarov at the following address: amelizarov@gmail.com.
The publishers of RDLJ is not responsible for the view, set out in the published opinion articles.
We suggest the authors of articles downloaded from this page, sign it and send it to the journal publisher's address by e-mail scan copyright agreements on the transfer of non-exclusive rights to use the work.