A note on graphs whose largest eigenvalues of the modularity matrix equals zero

zbMATH Open1327.05213MaRDI QIDQ5501692FDOQ5501692

Authors: Snježana Majstorović, Dragan Stevanović 

Publication date: 14 August 2015

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• An algebraic analysis of the graph modularity
• Spectral properties of modularity matrices
• Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix
• Modularity-maximizing graph communities via mathematical programming
• Maximum modular graphs

zbMATH Keywords

largest eigenvaluecomplete multipartite graphmodularity matrixcommunity structure

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Systems biology, networks (92C42) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cited In (2)

• The expected adjacency and modularity matrices in the degree corrected stochastic block model
• Modularity of Erdős-Rényi random graphs

This page was built for publication: A note on graphs whose largest eigenvalues of the modularity matrix equals zero

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501692)