Abstract
In the network analysis, vulnerability plays key role. Similarly, Laplacian matrices are also effective tools in network analysis. In this study, we examine correlations between those two concepts. We first calculate the well-known vulnerability measures called edge connectivity, vertex connectivity, and solitude number. Then, we find correlation between vulnerability measures and energies of Laplacian matrices. As a result, we find strong correlations between Laplacian energies and vertex connectivity of a network.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
