Antimagic labeling of biregular bipartite graphs (Q2112650): Difference between revisions

This paper investigates antimagic labeling of biregular bipartite graphs. For a biregular bipartite graph \(G[X, Y]\) with \(dG(x) = s\) for all \(x \in X\) and \(dG(y) = t\) for all \(y \in Y\), if \(s \ge t + 2 \) and there is an odd number in \(\{s, t\}\), then it is proved that \(G\) is antimagic. Thus, the study not only gives partial proof to the belief that every biregular bipartite graph is antimagic but also advances a step further to support the conjecture that every connected graph other than \(K_2\) is antimagic.