Dividing Graceful Labeling of Certain Tree Graphs
Autor: | null Abdullah Zahraa O, null Arif Nabeel E, null F. A. Fawzi |
---|---|
Rok vydání: | 2020 |
Předmět: | |
Zdroj: | Tikrit Journal of Pure Science. 25:123-126 |
ISSN: | 2415-1726 1813-1662 |
DOI: | 10.25130/tjps.v25i4.281 |
Popis: | A tree is a connected acyclic graph on n vertices and m edges. graceful labeling of a tree defined as a simple undirected graph G(V,E) with order n and size m, if there exist an injective mapping that induces a bijective mapping defined by for each and . In this paper we introduce a new type of graceful labeling denoted dividing graceful then discuss this type of certain tree graphs . |
Databáze: | OpenAIRE |
Externí odkaz: |