Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection [closed]

edit

for g in graphs.nauty_geng("10 -c"):
if g.size() == 11:
   if g.girth()==5:
        g.show()
        h = g.laplacian_matrix().eigenvalues()
        h.sort()
        show(h)

How to find that bicyclic graph with fixed girth whose algebraic connectivity is highest among all other graphs? Definition of algebraic connectivity is https://en.wikipedia.org/wiki/Algebra... and girth of a graph is defined here https://en.wikipedia.org/wiki/Girth_(....