2013Unpublished venueRequires access

Further Results on Cocomplete Bipartite Graphs

Veena Mathad, Ali Mohammed Sahal

Open publisher page 0 citations

Abstract

Abstract. Let G = (V1, V2, E) be a bipartite graph. Then G is called cocom-plete bipartite graph, if for any two vertices u, v ∈ 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. 1.

About this research paper

What this paper is about

Abstract. Let G = (V1, V2, E) be a bipartite graph. Then G is called cocom-plete bipartite graph, if for any two vertices u, v ∈ 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. 1.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract. Let G = (V1, V2, E) be a bipartite graph. Then G is called cocom-plete bipartite graph, if for any two vertices u, v ∈ 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. 1.

Key concepts: Bipartite graph, Combinatorics, Mathematics, Complete bipartite graph, Edge-transitive graph, Triangle-free graph, Cograph, Foster graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Further Results on Cocomplete Bipartite Graphs — Research Paper | ScholarLens