ℤ2 × ℤ2-Cordial Cycle-Free Hypergraphs

Abstract

Hovey introduced A-cordial labelings as a generalization of cordial and harmonious labelings [7]. If A is an Abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edge labeling on G; the edge uv receives the label f(u) + f(v). A graph G is A-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one and (2) the induced edge label classes differ in size by at most one.

Keywords

• v4-cordial graph
• hypergraph
• labeling of hypergraph
• hyper-tree
• 05c65
• 05c78