EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-SA 4.0

LOCKS AND FORBIDDEN CONFIGURATIONS IN 4-GRACEFUL TREES

Vitaly A. Baransky, Ilia A. Nasyrov, Tatiana A. Senchonok

Ural Mathematical Journal · 29.07.2026 · 12 (1) · 26-44

DOI: 10.15826/umj.2026.1.003 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Ural Mathematical Journal, online erschienen am 29.07.2026. Verfasst von Vitaly A. Baransky und 2 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let \(f\) be a proper coloring of the vertices of a simple graph \(G\) into colors from the set of colors \(\{1, 2, \dots, k\}\). A coloring \(f\) on the set of edges of a graph \(G\) induces a function \(f'(e) = \vert{}f(u) - f(v)\vert{}\), where \(e = uv\) is an arbitrary edge of the graph \(G\). A coloring \(f\) is called a \(k\)-graceful coloring of a graph \(G\) if \(f^{\prime }\) is an edge proper coloring of this graph. We will call a graph a \(k\)-graceful graph or, simply, graceful graph if it has a \(k\)-graceful coloring. In this paper, we continue the study of 4-graceful trees. We introduce the concept of a lock in a tree \(T\) with maximum vertex degree \(\Delta = 3\). A lock is a configuration \(H\) in \(T\) whose main property is the presence of two special vertices \(u\) and \(v\) such that for any 4-graceful colorings of \(T\), the pair of vertices \(u\) and \(v\) has a unique coloring in the colors from the set \(\{1, 2, 3, 4\}\) up to duality. The main goals of this work are as follows: 1) to construct some simple locks and indicate procedures whose application to known locks generates new locks (see Theorem 1); 2) to use locks and nodal 1-components for finding forbidden configurations for 4-graceful trees (see Propositions 1 and 2, as well as Theorem 2).

Zitieren

APA

Baransky, V. A., Nasyrov, I. A., & Senchonok, T. A. (2026). LOCKS AND FORBIDDEN CONFIGURATIONS IN 4-GRACEFUL TREES. Ural Mathematical Journal, 12(1), 26-44. https://doi.org/10.15826/umj.2026.1.003

Vancouver

Baransky VA, Nasyrov IA, Senchonok TA. LOCKS AND FORBIDDEN CONFIGURATIONS IN 4-GRACEFUL TREES. Ural Mathematical Journal. 2026;12(1):26-44. doi:10.15826/umj.2026.1.003

BibTeX
@article{Baransky2026,
  author = {Baransky, Vitaly A. and Nasyrov, Ilia A. and Senchonok, Tatiana A.},
  title = {LOCKS AND FORBIDDEN CONFIGURATIONS IN 4-GRACEFUL TREES},
  journal = {Ural Mathematical Journal},
  year = {2026},
  volume = {12},
  number = {1},
  pages = {26--44},
  doi = {10.15826/umj.2026.1.003}
}
Kostenlos starten →