on Graph Labeling Problems of Antimagic Type
碩士 === 東海大學 === 數學系 === 94 === Assume G is a simple graph with p vertices and q edges. An edge labeling of a graph G is an assignment of integers to edges, which satisfies certain prescribed conditions. If the vertex sums are pairwise distinct in certain sense where the vertex sum is the sum of the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93438938170089870883 |