On k-super graceful graphs with extremal maximum vertex degree
Let GV(,E) be a simple and loopless graph with |V|vertices and |E|edges. For k ≥ 1, a graph G is called k-super graceful if there is a bijective labeling f:V∪ E → {|i k ≤i≤k + |V| + |E| − 1} with f (vu) = | fv() − fu()| for every edge vu∈ E. In this paper, we study the existence of k-super graceful...
| Published in: | Journal of Discrete Mathematical Sciences and Cryptography |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Taru Publications
2024
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85205214824&doi=10.47974%2fJDMSC-1722&partnerID=40&md5=86316704d614ffea01ba9a751224de38 |
| id |
2-s2.0-85205214824 |
|---|---|
| spelling |
2-s2.0-85205214824 Lau G.-C.; Shiu W.C.; Ng H.-K.; Gao Z.-B.; Schaffer K. On k-super graceful graphs with extremal maximum vertex degree 2024 Journal of Discrete Mathematical Sciences and Cryptography 27 6 10.47974/JDMSC-1722 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85205214824&doi=10.47974%2fJDMSC-1722&partnerID=40&md5=86316704d614ffea01ba9a751224de38 Let GV(,E) be a simple and loopless graph with |V|vertices and |E|edges. For k ≥ 1, a graph G is called k-super graceful if there is a bijective labeling f:V∪ E → {|i k ≤i≤k + |V| + |E| − 1} with f (vu) = | fv() − fu()| for every edge vu∈ E. In this paper, we study the existence of k-super graceful labeling of certain graphs with extremal maximum vertex degree. © 2024, Taru Publications. All rights reserved. Taru Publications 09720529 English Article |
| author |
Lau G.-C.; Shiu W.C.; Ng H.-K.; Gao Z.-B.; Schaffer K. |
| spellingShingle |
Lau G.-C.; Shiu W.C.; Ng H.-K.; Gao Z.-B.; Schaffer K. On k-super graceful graphs with extremal maximum vertex degree |
| author_facet |
Lau G.-C.; Shiu W.C.; Ng H.-K.; Gao Z.-B.; Schaffer K. |
| author_sort |
Lau G.-C.; Shiu W.C.; Ng H.-K.; Gao Z.-B.; Schaffer K. |
| title |
On k-super graceful graphs with extremal maximum vertex degree |
| title_short |
On k-super graceful graphs with extremal maximum vertex degree |
| title_full |
On k-super graceful graphs with extremal maximum vertex degree |
| title_fullStr |
On k-super graceful graphs with extremal maximum vertex degree |
| title_full_unstemmed |
On k-super graceful graphs with extremal maximum vertex degree |
| title_sort |
On k-super graceful graphs with extremal maximum vertex degree |
| publishDate |
2024 |
| container_title |
Journal of Discrete Mathematical Sciences and Cryptography |
| container_volume |
27 |
| container_issue |
6 |
| doi_str_mv |
10.47974/JDMSC-1722 |
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85205214824&doi=10.47974%2fJDMSC-1722&partnerID=40&md5=86316704d614ffea01ba9a751224de38 |
| description |
Let GV(,E) be a simple and loopless graph with |V|vertices and |E|edges. For k ≥ 1, a graph G is called k-super graceful if there is a bijective labeling f:V∪ E → {|i k ≤i≤k + |V| + |E| − 1} with f (vu) = | fv() − fu()| for every edge vu∈ E. In this paper, we study the existence of k-super graceful labeling of certain graphs with extremal maximum vertex degree. © 2024, Taru Publications. All rights reserved. |
| publisher |
Taru Publications |
| issn |
09720529 |
| language |
English |
| format |
Article |
| accesstype |
|
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1814778498663841792 |