EUVIMEDEUVIMED entdecken
Crossref

Some methods for constructing some classes of graceful uniform trees

I Nengah Suparta, I Dewa Made Agus Ariawan

Indonesian Journal of Combinatorics · 2018

DOI: 10.19184/ijc.2018.2.2.7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2018. Verfasst von I Nengah Suparta und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A tree T(V, E) is graceful if there exists an injective function f from the vertex set V(T) into the set {0, 1, 2, ..., ∣V∣ − 1} which induces a bijective function fʹ from the edge set E(T) onto the set {1, 2, ..., ∣E∣}, with fʹ(uv) = ∣f(u) − f(v)∣ for every edge {u, v} ∈ E. Motivated by the conjecture of Alexander Rosa (see) saying that all trees are graceful, a lot of works have addressed gracefulness of some trees. In this paper we show that some uniform trees are graceful. This results will extend the list of graceful trees.

Zitieren

APA

Suparta, I. N., & Ariawan, I. D. M. A. (2018). Some methods for constructing some classes of graceful uniform trees. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2018.2.2.7

Vancouver

Suparta IN, Ariawan IDMA. Some methods for constructing some classes of graceful uniform trees. Indonesian Journal of Combinatorics. 2018. doi:10.19184/ijc.2018.2.2.7

BibTeX
@article{Suparta2018,
  author = {Suparta, I Nengah and Ariawan, I Dewa Made Agus},
  title = {Some methods for constructing some classes of graceful uniform trees},
  journal = {Indonesian Journal of Combinatorics},
  year = {2018},
  doi = {10.19184/ijc.2018.2.2.7}
}
Kostenlos starten →