Details

Autor(en) / Beteiligte

• Kuo, David
• Chang, Gerard J.
• Kwong, Y.H.Harris

Titel

Cordial labeling of mKn

Ist Teil von

• Discrete mathematics, 1997-05, Vol.169 (1), p.121-131

Ort / Verlag

Elsevier B.V

Erscheinungsjahr

1997

Link zum Volltext

Quelle

Elsevier Journal Backfiles on ScienceDirect (DFG Nationallizenzen)

Beschreibungen/Notizen

• Suppose G = ( V, E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0, 1} induces an edge labeling f∗ : E → {0, 1} defined by f∗(xy) = |f(x) − f(y)|. For i ϵ {0, 1}, let vf( i) and ef( i) be the number of vertices v and edges e with f( v) = i and f∗(e) = i, respectively. A graph G is cordial if there exists a vertex labeling f such that | vf(0) − vf(1)| ⩽ 1 and | ef(0) − ef(1)| ⩽ 1. This paper determines all m and n for which mK n is cordial.