Construction of additively graceful signed graphs-I
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910090309664768 |
|---|---|
| author | Acharya, Mukti |
| author_facet | Acharya, Mukti |
| contents | In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful signed graphs. We find the values of m, n in non-divisible sum graph, denoted as G(m, n), that admit additively graceful labeling. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_30009 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Construction of additively graceful signed graphs-I Acharya, Mukti Combinatorics In this paper, we construct additively graceful signed graphs S from a given graph G that may be additively graceful or not be additively graceful. We also show the construction of additively graceful signed graphs from additively graceful signed graphs. We find the values of m, n in non-divisible sum graph, denoted as G(m, n), that admit additively graceful labeling. |
| title | Construction of additively graceful signed graphs-I |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.30009 |