Laudari Sudip: Graph theory

1871 days ago by bigdata2016

G= graphs.CompleteBipartiteGraph(3,7); G.show() 
       
 
       
 
       
G= graphs.CompleteBipartiteGraph(6,4); G.show() 
       
G.size() A=G.adjacency_matrix();Aeig=A.eigenvalues();Aeig.sort(reverse=True); #L=G.laplacian_matrix();Leig=L.eigenvalues();Leig.sort(reverse=True); print("Adjacency spectrum of G is", Aeig) #print("Laplacian spectrum of G is", Leig) 
       
('Adjacency spectrum of G is', [4.898979485566356?, 0, 0, 0, 0, 0, 0, 0,
0, -4.898979485566356?])
('Adjacency spectrum of G is', [4.898979485566356?, 0, 0, 0, 0, 0, 0, 0, 0, -4.898979485566356?])