Bipartite Graphs and Digraphs with Maximum Connectivity
暂无分享,去创建一个
[1] Bohdan Zelinka. On a problem of a. kotzig concerning factorizations of 4-regular graphs , 1984, J. Graph Theory.
[2] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.
[3] Saumyendra Sengupta,et al. Graphs and Digraphs , 1994 .
[4] M. Aigner. On the linegraph of a directed graph , 1967 .
[5] Claudine Peyrat,et al. Sufficient conditions for maximally connected dense graphs , 1987, Discret. Math..
[6] Miguel Angel Fiol,et al. Maximally connected digraphs , 1989, J. Graph Theory.
[7] Linda .LESNIAK. Results on the edge-connectivity of graphs , 1974, Discret. Math..
[8] Miguel Angel Fiol,et al. Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.
[9] J. Plesník,et al. On equality of edge-connectivity and minimum degree of a graph , 1989 .
[10] Miguel Angel Fiol,et al. The connectivity of large digraphs and graphs , 1993, J. Graph Theory.
[11] M. A. Fiol,et al. Dense bipartite digraphs , 1990, J. Graph Theory.
[12] Charles Delorme,et al. Large bipartite graphs with given degree and diameter , 1985, J. Graph Theory.
[13] Jean-Claude Bermond,et al. Large fault-tolerant interconnection networks , 1989, Graphs Comb..