Search
Now showing items 1-1 of 1
The Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)-Atimagic Total Labeling
(2018-02-28)
We assume that all graphs in this paper are finite, undirected and no loop and multiple
edges. Given a graph G of order p and size q.LetH
,H be subgraphs of G.ByH
-covering,
we mean every edge in E(G) belongs to at ...