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 |
| Summary: | 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. |
|---|---|
| ISSN: | 9720529 |
| DOI: | 10.47974/JDMSC-1722 |