The cordiality of the path-union of \(n\) copies of a graph (Q1916396)

A graph \(G= (V, E)\) is cordial iff there exists a partition \(\{V_1, V_2\}\) of \(V\) such that the two induced subgraphs \(G_1= (V_1, E_1)\) and \(G_2= (V_2, E_2)\) satisfy the following conditions: \(|V_1|- |V_2|\leq 1\) and \(|E|- 2(|E_1|+ |E_2|)|\leq 1\). Assume that \(G_1,\dots, G_k\) are \(k\) \((\geq 2)\) copies of a graph \(G\). \(G(k)\) stands for the graph obtained from the graphs \(G_1,\dots, G_k\) by adding an edge to \(G_i\) and \(G_{i+ 1}\), for \(i= 1,\dots, k- 1\), and \(G(k)\) is called the path-union of the \(k\) copies of \(G\). Some sufficient conditions for the path-unions of graphs are obtained. In particular, the path-unions of cycles, wheels, fans, and some cliques are shown to be cordial.