The antimagic labeling of balanced double star union cP3
碩士 === 國立中興大學 === 應用數學系所 === 107 === Let G(V,E) be a finite simple graph, where V is called vertex set which is a set whose elements are called vertices, and E is called edge set which is a two-set with distinct elements of vertex set. An edge labeling of G is a bijection function f:E(G) → {1,2,...,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5507007%22.&searchmode=basic |