ON k-CORDIALITY OF CYCLES, CROWNS AND WHEELS

摘要

A graph G is called A-cordial if there is a vertex labelling f of G with elements from A, where A is an abelian group, such that |v_a - v_b| ≤ 1 for all a, b ∈ A, in which v_a denotes the number of vertices labelled a, and the induced edge labelling defined by f(uv)) = f(u) + f(v) satisfies |e_a - e_b| ≤ 1, here e_a denoting the number of edges labelled a. For the cyclic group Z_k of order k, a Z_k-cordial graph is briefly called a k-cordial graph.