Book graphs are cycle antimagic
Let \(G=(V,E)\) be a finite simple graph with \(v =|V(G)|\) vertices and \(e=|E(G)|\) edges. Further suppose that \(\mathbb{H}:=\{H_1, H_2, \dots, H_t\}\) is a family of subgraphs of \(G\). In case, each edge of \(E(G)\) belongs to at least one of the subgraphs \(H_i\) from the family \(\mathbb{H}\)...
Main Authors: | Muhammad Awais Umar, Noshad Ali, Afshan Tabassum, Basharat Rehman Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
Ptolemy Scientific Research Press
2019-06-01
|
Series: | Open Journal of Mathematical Sciences |
Subjects: | |
Online Access: | https://pisrt.org/psr-press/journals/oms-vol-3-2019/book-graphs-are-cycle-antimagic/ |
Similar Items
-
Super ( a , d ) - C 4 -antimagicness of book graphs
by: Muhammad Awais Umar, et al.
Published: (2018-05-01) -
Super $(a,d)$-$C_3$-antimagicness of a Corona Graph
by: Noshad Ali, et al.
Published: (2018-12-01) -
Stacked book graphs are cycle-antimagic
by: Xinqiang Ma, et al.
Published: (2020-07-01) -
Antimagicness of subdivided fans
by: Afshan Tabassum, et al.
Published: (2020-02-01) -
Cyclic-antimagic construction of ladders
by: Muhammad Awais Umar
Published: (2019-06-01)