完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, Zhen-Chun | en_US |
dc.contributor.author | Huang, Kuo-Ching | en_US |
dc.contributor.author | Lin, Chiang | en_US |
dc.contributor.author | Shang, Jen-Ling | en_US |
dc.contributor.author | Lee, Ming-Ju | en_US |
dc.date.accessioned | 2020-10-05T02:01:09Z | - |
dc.date.available | 2020-10-05T02:01:09Z | - |
dc.date.issued | 2020-03-01 | en_US |
dc.identifier.issn | 0315-3681 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/155198 | - |
dc.description.abstract | An edge labeling of a graph G is a bijection f : E(G) {1, 2, " " ", 1E(G)1}. The induced vertex sum f+ of f is a function defined on V(G) given by f+ (u) = E(G) f(uv) for all u E V(G). The value f+(u) is called the vertex sum at u. The graph G is called antimagic if there exists an edge labeling of G such that the vertex sums at all vertices of G are distinct. A star forest is the union of disjoint stars. Let S denote a star with n edges, and mS denote a star forest consisting of the disjoint m copies of S. It is known that mS2 is antimagic if and only if m = 1. In this study, a necessary condition and a sufficient condition are obtained whereby a star forest mS2 U Snr U Snz U " " " U Sn, (ni, n2, " " ", nk > 3) may be antimagic. In addition, a necessary and sufficient condition is obtained whereby a star forest mS2 US (n > 3) may be antimagic. Moreover, a graph consisting of disjoint stars together with an extra disjoint path is also verified to be antimagic. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Antimagicness of star forests | en_US |
dc.type | Article | en_US |
dc.identifier.journal | UTILITAS MATHEMATICA | en_US |
dc.citation.volume | 114 | en_US |
dc.citation.spage | 283 | en_US |
dc.citation.epage | 294 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000553641800019 | en_US |
dc.citation.woscount | 0 | en_US |
顯示於類別: | 期刊論文 |