On k-super graceful graphs with extremal maximum vertex degree

Authors

Gee Choon Lau, Universiti Teknologi MARA
Wai Chee Shiu, Chinese University of Hong Kong
Ho Kuen Ng, San Jose State UniversityFollow
Zhen Bin Gao, Harbin Engineering University
Karl Schaffer, De Anza College

Publication Date

9-1-2024

Document Type

Article

Publication Title

Journal of Discrete Mathematical Sciences and Cryptography

Volume

27

Issue

6

DOI

10.47974/JDMSC-1722

First Page

1765

Last Page

1783

Abstract

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.

Funding Sponsor

Universiti Teknologi MARA

Keywords

Cycles, Graceful labeling, k-super graceful, Paths

Department

Mathematics and Statistics

Recommended Citation

Gee Choon Lau, Wai Chee Shiu, Ho Kuen Ng, Zhen Bin Gao, and Karl Schaffer. "On k-super graceful graphs with extremal maximum vertex degree" Journal of Discrete Mathematical Sciences and Cryptography (2024): 1765-1783. https://doi.org/10.47974/JDMSC-1722