how to find the tree having largest algebraic connectivity among a given class of trees

asked 2018-04-23 16:03:17 +0100

anonymous user


using the code, g for g in graphs.trees(10) we get the trees on 10 vertices. Now from this collection how we obtain only those trees having 5 pendant vertices and also find the tree(from those having 5 pendant vertices) having largest algebraic connectivity

edit retag flag offensive close merge delete


This looks like homework. What were your attempts in solving this ?

tmonteil gravatar imagetmonteil ( 2018-04-23 17:07:45 +0100 )edit