-super antimagic total labeling of comb product of graphs
Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product between and , denoted by , is a graph obtained by taking one copy of and copies of and grafting the th copy of at the vertex to the th vertex of . By definition of comb product of two graphs, we can say th...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.008 |