Exact modularity of line graphs of complete graphs

DOI10.2140/moscow.2021.10.61zbMath1459.05281OpenAlexW3121532042MaRDI QIDQ2229338

Mikhail Ipatov

Publication date: 23 February 2021

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2021.10.61

zbMATH Keywords

modularityline graphsJohnson graphs

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Modularity in planted partition model ⋮ New lower bound on the modularity of Johnson graphs ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ Spectrum of Johnson graphs

Cites Work

• General results on preferential attachment and clustering coefficient
• Random Kneser graphs and hypergraphs
• The isoperimetric number of random regular graphs
• Intersection theorems with geometric consequences
• Modularity in several random graph models
• The Borsuk partition problem: the seventieth anniversary
• Modularity of complex networks models
• On a Frankl-Wilson theorem
• New bounds on clique-chromatic numbers of Johnson graphs
• On the independence number and the chromatic number of generalized preferential attachment models
• New bounds for the clique-chromatic numbers of Johnson graphs
• On the chromatic number of random subgraphs of a certain distance graph
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Around Borsuk's hypothesis
• A counterexample to Borsuk’s conjecture
• Clustering Properties of Spatial Preferential Attachment Model
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact modularity of line graphs of complete graphs