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

asked 2023-04-28 13:57:02 +0200

anonymous user

Anonymous

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_(....

edit retag flag offensive reopen merge delete

Closed for the following reason duplicate question by Max Alekseyev
close date 2023-05-05 00:41:28.858396

Comments

1

The first step is to seach for keyword bicyclic in this forum. You will find 46577/maximum-algebraic-connectivity-from-a-given-collection-of-graphs/.

David Coudert gravatar imageDavid Coudert ( 2023-04-30 16:08:15 +0200 )edit
add a comment