Cordial labelings and 3-cordial labelings of union and join of graphs

碩士 === 國立東華大學 === 應用數學系 === 94 === Let G be a graph with vertex set V (G) and edge set E (G), and let A be an abelian group. A vertex labeling f : V(G) →A induces an edge labeling f * : E(G) → A, defined by f *(uv) = f (u) + f (v) for all uv belongs to E (G). For i belongs to A, let v_f^i(G)=|{v bel...

Full description

Bibliographic Details
Main Authors: Wen-Hsun Cho, 卓文勛
Other Authors: David Kuo
Format: Others
Language:en_US
Published: 2006
Online Access:http://ndltd.ncl.edu.tw/handle/42911847041201420411