New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)

DOI10.1134/S0032946021040086zbMath1481.05126OpenAlexW4206785270MaRDI QIDQ2068829

N. M. Derevyanko, Mikhail M. Koshelev

Publication date: 20 January 2022

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946021040086

zbMATH Keywords

random graphsmodularityJohnson graphsclusterization

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

Modularity in planted partition model ⋮ Spectrum of Johnson graphs

Cites Work

• Unnamed Item
• General results on preferential attachment and clustering coefficient
• On the stability of the Erdős-Ko-Rado theorem
• The isoperimetric number of random regular graphs
• Intersection theorems with geometric consequences
• Modularity in several random graph models
• Exact modularity of line graphs of complete graphs
• New lower bound on the modularity of Johnson graphs
• Modularity of some distance graphs
• Asymptotic Modularity of Some Graph Classes
• A counterexample to Borsuk’s conjecture
• Modularity of regular and treelike graphs
• On Finding Graph Clusterings with Maximum Modularity
• Communities in Networks
• Modularity of Erdős‐Rényi random graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Maximum modular graphs

This page was built for publication: New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)