• Citations Per Year
Learn More
Let G = (V1, V2, E) be a balanced bipartite graph with 2n vertices. The bipartite binding number of G, denoted by B(G), is defined to be n if G = Kn,n and min i∈{1,2} min ∅̸=S⊆Vi |N(S)|<n |N(S)|/|S| otherwise. We call G bipancyclic if it contains a cycle of every even length m for 4 ≤ m ≤ 2n. The purpose of this paper is to show that if B(G) > 3/2 and n ≥(More)
  • 1