Cocomplete bipartite graphs
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let G = (V1, V2,E) be a bipartite graph. Then G is called cocomplete bipartite graph, if for any two vertices u, v 2 Vi, i=1,2 there exists P3 containing them. In this paper, we study some properties of cocomplete bipartite graphs. We obtain the necessary and sufficient condition for a cocomplete bipartite graph to be complete bipartite. We also study the condition under which a bipartite graph becomes cocomplete bipartite graph. Further, we establish the relation between balanced bipartite graph and cocomplete bipartite graph. We find the bound for the number of edges of cocomplete bipartite graph.
Abstract
Let G = (V1, V2,E) be a bipartite graph. Then G is called cocomplete bipartite graph, if for any two vertices u, v 2 Vi, i=1,2 there exists P3 containing them. In this paper, we study some properties of cocomplete bipartite graphs. We obtain the necessary and sufficient condition for a cocomplete bipartite graph to be complete bipartite. We also study the condition under which a bipartite graph becomes cocomplete bipartite graph. Further, we establish the relation between balanced bipartite graph and cocomplete bipartite graph. We find the bound for the number of edges of cocomplete bipartite graph.
참고문헌 (6)
- Andr´as Gy´arf´as, "Size of Monochromatic Double Stars in Edge Colorings", Graphs and Combinatorics, 24, pp.531~536 (2008)
- Amin Witno, "Graph Theory, Won Series in Discrete Mathematics and Modern Algebra Volume 4", ~ (2006)
- Daniel Brito, "Pedro Mago and Lope Mar in, Neighborhood Conditions for Balanced Bipartite Graphs to be Hamiltonian Connected", International Mathematical Forum, 5(26), pp.1291~1295 (2010)
- Denise Amar, "Neighborhood conditions for balanced independent sets in bipartite graphs", Discrete Mathematics, 181, pp.31~36 (1998)
- F. Harary, "Graph Theory, Addison Wesley, Reading Mass" (1969)
- Jacob Fox, "Decompositions into Subgraphs of Small Diameter, Combinatorics", Probability and Computing, 19, pp.753~774 (2010)