Authors: Elmar Guseinov
В данной статье приводится решение 83 проблем, формулировка которых близка к формулировке гипотезы грациозности деревьев. В частности, было найдено дерево T=(E,V) с инъективной разметкой рёбер h числами {1,...,|E|}, для которой нельзя указать инъективной разметки вершин f, так чтобы для каждого ребра ab∈E выполнялось условие |f(a)-f(b)|=h(ab). Для оптимизации процесса решения была написана соответствующая рекомендательная программа.
In this article, we solve 83 problems related to the graceful tree conjecture. In particular, we have found a tree T=(E,V) and injective edge labeling h:E→{1,...,|E|} such that there is no injective vertex labeling f with the property that |f(a)-f(b)|=h(ab) for all ab∈E. To optimize the solution process, a recommendation computer program was written.
Comments: Pages.
Download: PDF
[v1] 2022-05-12 23:47:03
[v2] 2022-05-17 05:30:15
[v3] 2022-09-07 23:43:10
Unique-IP document downloads: 531 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.