On super --antimagic total labeling of disjoint union of cycles
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.017 |
| id |
doaj-5e95f939f577469ab4e6d7e8c720d0de |
|---|---|
| record_format |
Article |
| spelling |
doaj-5e95f939f577469ab4e6d7e8c720d0de2020-11-25T02:06:53ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002018-04-01151222610.1016/j.akcej.2018.01.01712092649On super --antimagic total labeling of disjoint union of cyclesFaisal Susanto0Department of Mathematics, Faculty of Mathematics and Natural Sciences, Tadulako UniversityLet 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 .http://dx.doi.org/10.1016/j.akcej.2018.01.017super --antimagic total labelingdisconnected graphdisjoint union of cycles |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Faisal Susanto |
| spellingShingle |
Faisal Susanto On super --antimagic total labeling of disjoint union of cycles AKCE International Journal of Graphs and Combinatorics super --antimagic total labeling disconnected graph disjoint union of cycles |
| author_facet |
Faisal Susanto |
| author_sort |
Faisal Susanto |
| title |
On super --antimagic total labeling of disjoint union of cycles |
| title_short |
On super --antimagic total labeling of disjoint union of cycles |
| title_full |
On super --antimagic total labeling of disjoint union of cycles |
| title_fullStr |
On super --antimagic total labeling of disjoint union of cycles |
| title_full_unstemmed |
On super --antimagic total labeling of disjoint union of cycles |
| title_sort |
on super --antimagic total labeling of disjoint union of cycles |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 |
| publishDate |
2018-04-01 |
| description |
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 . |
| topic |
super --antimagic total labeling disconnected graph disjoint union of cycles |
| url |
http://dx.doi.org/10.1016/j.akcej.2018.01.017 |
| work_keys_str_mv |
AT faisalsusanto onsuperantimagictotallabelingofdisjointunionofcycles |
| _version_ |
1724932133204525056 |