Dividing Graceful Labeling of Certain Tree Graphs
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tikrit University
2020-08-01
|
| Series: | Tikrit Journal of Pure Science |
| Subjects: | |
| Online Access: | https://tjpsj.org/index.php/tjps/article/view/281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|