Measures of closeness to cordiality for graphs

Anand Brahmbhatt, Kartikeya Rai, Amitabha Tripathi

A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ di…