On Graph Labeling Problems of Magic and Anti-magic Types

碩士 === 東海大學 === 應用數學系 === 101 === Let G = (V (G),E(G)) be a finite simple graph with p = |V (G)| vertices and q = |E(G)| edges. An antimagic labeling of G is a bijection from the set of edges to the set of integers {1, 2, · · · , q} such that the vertex sums are pairwise distinct, where the vertex s...

Full description

Bibliographic Details
Main Authors: Guang-Hui Zhang, 張光輝
Other Authors: Tao-Ming Wang
Format: Others
Language:en_US
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/57223532679736821356