1 votes 1 votes For complete bipartite graph k2,3 , what is the edge connectivity ? Ismail asked Aug 11, 2017 edited Aug 11, 2017 by Tesla! Ismail 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I think in general edge connectivity of Km,n= min(m,n) where Km,n is complete bipartie graph so $K_{2,3}$=2 Tesla! answered Aug 11, 2017 Tesla! comment Share Follow See all 2 Comments See all 2 2 Comments reply Ismail commented Aug 11, 2017 reply Follow Share Yes that is what i think too... But in my ace printed notes it is given as max{m,n} .. and i m thinking how is that possible ... Is there any reliable source of your answer @tesla 0 votes 0 votes Tesla! commented Aug 11, 2017 reply Follow Share Well it just clicked to me when I solved this, not all things are given in book but we both are getting same answer, don't trust any practice book many things are given worng in such books 0 votes 0 votes Please log in or register to add a comment.