Further Results on Cocomplete Bipartite Graphs
Veena Mathad, Ali Mohammed Sahal
Abstract
Veena Mathad, Ali Mohammed Sahal
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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