Further Results on Cocomplete Bipartite Graphs (original) (raw)

Asian Journal of Mathematics and Applications, 2013

Abstract

Let G = (V1, V2,E) be a bipartite graph. Then G is called cocomplete bipartite graph, if for any two vertices u, v \in Vi, i = 1, 2 there exists P3 containing them. In this paper, we introduce the concepts of Weak and Strong cocomplete bipartite graphs. We study some properties of these graphs. We also develop furthers results on cocomplete bipartite graph.

Ali Sahal hasn't uploaded this paper.

Let Ali know you want this paper to be uploaded.

Ask for this paper to be uploaded.