Almost arbitrary supersubdivision of every graph is cordial (Q2829335)

Let \(G=(V,E)\) be a graph, \(f:G\rightarrow \{0,1\}\) be a labeling of vertices of \(G,\) and \(l(e):=\left| f(u)-f(v)\right| \) be an induced labeling of an edge \(e=uv\). Then, \(G\) \(\;\)is called cordial if there exists a labeling \(f\) such that \(\left| |\{v;f(v)=0\}|-|\{v;f(v)=1\}|\right| \leq 1\) and also \(\left| |\{e;l(e)=0\}|-|\{e;f(e)=1\}|\right| \leq 1\).NEWLINENEWLINEIt is proved that to each graph \(G\) there exists a so called almost arbitrary supersubdivision of \(G\) (each edge \(e\) of \(G\) is replaced by a complete bipartite graph \(K_{2,m_{e}}\)) that is cordial.