# Revision history [back]

### Graphs having highest second smallest laplacian eigen value

for G in graphs(7):

if G.girth()==4:


$L=G$.laplacian_matrix().eigenvalues()

$L$.sort()

show(L)

$G$.show()

Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others.

### Graphs having highest second smallest laplacian eigen value

for G in graphs(7):

if G.girth()==4:


$L=G$.laplacian_matrix().eigenvalues()

$L$.sort()

show(L)

$G$.show()

Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others.

### Graphs having highest second smallest laplacian eigen valuevalue from a collection

for G in graphs(7):

if G.girth()==4:


$L=G$.laplacian_matrix().eigenvalues()

$L$.sort()

show(L)

$G$.show()

Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others. 4 None

### Graphs having highest second smallest laplacian eigen value from a collection

for G in graphs(7):

graphs(7):
if G.girth()==4:


$L=G$.laplacian_matrix().eigenvalues()

$L$.sort()

show(L)

$G$.show() L = G.laplacian_matrix().eigenvalues() L.sort() show(L) G.show()

Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others. 5 None

### Graphs having highest second smallest laplacian eigen value from a collection

for G in graphs(7): if G.girth()==4: L = G.laplacian_matrix().eigenvalues() L.sort() show(L) G.show()

Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others. 6 None

### Graphs having highest second smallest laplacian eigen value from a collection

for G in graphs(7): if G.girth()==4: L = G.laplacian_matrix().eigenvalues() L.sort() show(L) G.show()

Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others. 7 None

### Graphs having highest second smallest laplacian eigen value from a collection

Using this code

for G in graphs(7):
if G.girth()==4:
L = G.laplacian_matrix().eigenvalues()
L.sort()
show(L)
G.show()G.show()


Using this code I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others. 8 None

### Graphs having highest second smallest laplacian eigen value from a collection

Using this code

for G in graphs(7):
if G.girth()==4:
L = G.laplacian_matrix().eigenvalues()
L.sort()
show(L)
G.show()


I have generated all graphs on $7$ vertices having girth=4. Now, from this code can we get the only unique graph having largest algebraic connectivity among all others.