Advances and Applications in Discrete Mathematics
Volume 3, Issue 2, Pages 155 - 164
(April 2009)
|
|
NOTES ON BIPARTITE GRAPHS WITH A PERFECT MATCHING AND DIGRAPHS
Zan-Bo Zhang (P. R. China) and Dingjun Lou (P. R. China)
|
Abstract: An equivalent relation between extendibility of bipartite graphs and strongly connectivity of digraphs is introduced in [7]. It is used to obtain a simple proof of an existing result on k-extendable bipartite graphs. Then, a few more results on bipartite graphs with a perfect matching and digraphs are shown. Finally, the relations among k-extendable bipartite graphs, k-strong digraphs and combinatorial matrices are studied. |
Keywords and phrases: k-extendable, strongly k-connected, strong component, elementary component, indecomposable, irreducible. |
|
Number of Downloads: 273 | Number of Views: 548 |
|