On k-super graceful graphs with extremal maximum vertex degree
Let G ( V , 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 f V boolean OR E-* {i|k i | k <= i <= k + | V | + | E | - 1} with f ( vu ) = | f ( v ) -f f ( u )| for every edgevu v...
| Published in: | JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY |
|---|---|
| Main Authors: | , , , , , |
| Format: | Article |
| Language: | English |
| Published: |
TARU PUBLICATIONS
2024
|
| Subjects: | |
| Online Access: | https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001332543600004 |
| author |
Lau Gee-Choon; Shiu Wai Chee; Ng Ho-Kuen; Gao Zhen-Bin; Schaffer Karl |
|---|---|
| spellingShingle |
Lau Gee-Choon; Shiu Wai Chee; Ng Ho-Kuen; Gao Zhen-Bin; Schaffer Karl On k-super graceful graphs with extremal maximum vertex degree Mathematics |
| author_facet |
Lau Gee-Choon; Shiu Wai Chee; Ng Ho-Kuen; Gao Zhen-Bin; Schaffer Karl |
| author_sort |
Lau |
| spelling |
Lau, Gee-Choon; Shiu, Wai Chee; Ng, Ho-Kuen; Gao, Zhen-Bin; Schaffer, Karl On k-super graceful graphs with extremal maximum vertex degree JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY English Article Let G ( V , 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 f V boolean OR E-* {i|k i | k <= i <= k + | V | + | E | - 1} with f ( vu ) = | f ( v ) -f f ( u )| for every edgevu vu . is an element of E In this paper, we study the existence of k-super graceful labeling of certain graphs with extremal maximum vertex degree. TARU PUBLICATIONS 0972-0529 2169-0065 2024 27 6 10.47974/JDMSC-1722 Mathematics WOS:001332543600004 https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001332543600004 |
| 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 |
| container_title |
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY |
| language |
English |
| format |
Article |
| description |
Let G ( V , 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 f V boolean OR E-* {i|k i | k <= i <= k + | V | + | E | - 1} with f ( vu ) = | f ( v ) -f f ( u )| for every edgevu vu . is an element of E In this paper, we study the existence of k-super graceful labeling of certain graphs with extremal maximum vertex degree. |
| publisher |
TARU PUBLICATIONS |
| issn |
0972-0529 2169-0065 |
| publishDate |
2024 |
| container_volume |
27 |
| container_issue |
6 |
| doi_str_mv |
10.47974/JDMSC-1722 |
| topic |
Mathematics |
| topic_facet |
Mathematics |
| accesstype |
|
| id |
WOS:001332543600004 |
| url |
https://www-webofscience-com.uitm.idm.oclc.org/wos/woscc/full-record/WOS:001332543600004 |
| record_format |
wos |
| collection |
Web of Science (WoS) |
| _version_ |
1814778545237393408 |