H-Coverings of Path-Amalgamated Ladders and Fans
Let G be a connected, simple graph with finite vertices v and edges e. A family G1,G2,…,Gp⊂G of subgraphs such that for all e∈E, e∈Gl, for some l, l=1,2,…,p is an edge-covering of G. If Gl≅ℍ, ∀l, then G has an ℍ-covering. Graph G with ℍ-covering is an ad,d-ℍ-antimagic if ψ:VG∪EG⟶1,2,…,v+e a bijectio...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2020-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2020/5846014 |