Special Graceful Labelings of Irregular Fences and Lobsters
Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of units. We prove here that any of these fences a...
Tác giả chính: | |
---|---|
Định dạng: | Bài viết |
Ngôn ngữ: | English |
Được phát hành: |
Emrah Evren KARA
2019-03-01
|
Loạt: | Universal Journal of Mathematics and Applications |
Những chủ đề: | |
Truy cập trực tuyến: | https://dergipark.org.tr/tr/download/article-file/675268 |