SET-CORDIALITY INDEX OF BIPARTITE GRAPHS VIA BOOLEAN LAYERS AND HYPERCUBE EMBEDDINGS
We study the set-cordiality index of graphs, a set-valued labeling parameter introduced by Naduvath [7], and develop a general framework for bipartite graphs. A universal lower bound is established in terms of the larger partite class, along with a sufficient condition for its attainment using three consecutive layers...