English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In 2009, Kong, Wang, and Lee began work on the problem of finding theedge-balanced index sets (EBI) of complete bipartite graphs K_{m,n} by solvingthe cases where n = 1, 2, 3, 4, and 5, and also the case where m = n. In 2011,Krop and Sikes expanded upon that work by finding EBI(K_{m,m-2a}) for odd m > 5and 1 <= a <= (m-3)/4. In this paper, we provide a general solution to theedge-balanced index set problem for all complete odd bipartite graphs, therebyconcluding the problem for this case.

A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs