Study on Graph Labeling and De ciencyProblems of Edge-Antimagic Type
博士 === 國立中興大學 === 應用數學系所 === 106 === A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. A finite simple graph G = (V,E) is called (a,d)edge-antimagic if there exists an injective vertex labeling function f : V → {1,2,··· ,|V|}such that the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/xt8hwj |