Pages that link to "Item:Q2139788"

The following pages link to Toughness and normalized Laplacian eigenvalues of graphs (Q2139788):

Displaying 12 items.

• Community detection in multiplex networks: a seed-centric approach (Q258458) (← links)
• The spectrum and toughness of regular graphs (Q403562) (← links)
• Comparison of communities detection algorithms for multiplex (Q1618459) (← links)
• Local community detection in multilayer networks (Q1741347) (← links)
• \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs (Q2091163) (← links)
• On the normalized distance Laplacian eigenvalues of graphs (Q2096347) (← links)
• Toughness in pseudo-random graphs (Q2225447) (← links)
• Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
• Extremal normalized Laplacian spectral radii of graphs (Q6084886) (← links)
• Spectral bounds for the vulnerability parameters of graphs (Q6125428) (← links)
• Toughness and normalized Laplacian eigenvalues of graphs (Q6422842) (← links)
• A unified framework for the expander mixing lemma for irregular graphs and its applications (Q6618703) (← links)