| Autor: |
Faisal Susanto |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 22-26 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
0972-8600 |
| DOI: |
10.1016/j.akcej.2018.01.017 |
| Popis: |
Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression where are two fixed integers and is the number of subgraphs of isomorphic to . Moreover, if the vertex set receives the minimum possible labels , then is called a super --antimagic total labeling. In this paper we study super --antimagic total labeling of a disconnected graph, namely . |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
