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 |