On k-graceful labeling of pendant edge extension of complete bipartite graphs
For any two positive integers m, n, we denote the graph Km,n ⊙ K₁ by G. Ma Ke-Jie proposed a conjecture [9] that pendant edge extension of a complete bipartite graph is a k-graceful graph for k > 2. In this paper we prove his conjecture for n ≤ m < n² + ⎣k/n⎦ + r.
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2018 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2018
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/188358 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | On k-graceful labeling of pendant edge extension of complete bipartite graphs / S. Bhoumik, S. Mitra // Algebra and Discrete Mathematics. — 2018. — Vol. 25, № 2. — С. 188–199. — Бібліогр.: 14 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862642861350060032 |
|---|---|
| author | Bhoumik, S. Mitra, S. |
| author_facet | Bhoumik, S. Mitra, S. |
| citation_txt | On k-graceful labeling of pendant edge extension of complete bipartite graphs / S. Bhoumik, S. Mitra // Algebra and Discrete Mathematics. — 2018. — Vol. 25, № 2. — С. 188–199. — Бібліогр.: 14 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | For any two positive integers m, n, we denote the graph Km,n ⊙ K₁ by G. Ma Ke-Jie proposed a conjecture [9] that pendant edge extension of a complete bipartite graph is a k-graceful graph for k > 2. In this paper we prove his conjecture for n ≤ m < n² + ⎣k/n⎦ + r.
|
| first_indexed | 2025-12-01T07:38:19Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-188358 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-01T07:38:19Z |
| publishDate | 2018 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Bhoumik, S. Mitra, S. 2023-02-25T14:40:32Z 2023-02-25T14:40:32Z 2018 On k-graceful labeling of pendant edge extension of complete bipartite graphs / S. Bhoumik, S. Mitra // Algebra and Discrete Mathematics. — 2018. — Vol. 25, № 2. — С. 188–199. — Бібліогр.: 14 назв. — англ. 1726-3255 2010 MSC: 05C78 https://nasplib.isofts.kiev.ua/handle/123456789/188358 For any two positive integers m, n, we denote the graph Km,n ⊙ K₁ by G. Ma Ke-Jie proposed a conjecture [9] that pendant edge extension of a complete bipartite graph is a k-graceful graph for k > 2. In this paper we prove his conjecture for n ≤ m < n² + ⎣k/n⎦ + r. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics On k-graceful labeling of pendant edge extension of complete bipartite graphs Article published earlier |
| spellingShingle | On k-graceful labeling of pendant edge extension of complete bipartite graphs Bhoumik, S. Mitra, S. |
| title | On k-graceful labeling of pendant edge extension of complete bipartite graphs |
| title_full | On k-graceful labeling of pendant edge extension of complete bipartite graphs |
| title_fullStr | On k-graceful labeling of pendant edge extension of complete bipartite graphs |
| title_full_unstemmed | On k-graceful labeling of pendant edge extension of complete bipartite graphs |
| title_short | On k-graceful labeling of pendant edge extension of complete bipartite graphs |
| title_sort | on k-graceful labeling of pendant edge extension of complete bipartite graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/188358 |
| work_keys_str_mv | AT bhoumiks onkgracefullabelingofpendantedgeextensionofcompletebipartitegraphs AT mitras onkgracefullabelingofpendantedgeextensionofcompletebipartitegraphs |