Tree-Antimagicness of Disconnected Graphs
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is said to be (a, d)-H-antimagic if there exists a bijection from the vertex set V(G) and the edge set E(G) onto the set of integers 1, 2, …,VG+E(G) such that, for all subgraphs H′ of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2015-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2015/504251 |