Exact modularity of line graphs of complete graphs
From MaRDI portal
Publication:2229338
DOI10.2140/MOSCOW.2021.10.61zbMATH Open1459.05281OpenAlexW3121532042MaRDI QIDQ2229338FDOQ2229338
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection theorems with geometric consequences
- The Borsuk partition problem: the seventieth anniversary
- Around Borsuk's hypothesis
- A counterexample to Borsuk’s conjecture
- Modularity in several random graph models
- Modularity of complex networks models
- The isoperimetric number of random regular graphs
- General results on preferential attachment and clustering coefficient
- Random Kneser graphs and hypergraphs
- 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
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- On the chromatic number of random subgraphs of a certain distance graph
- Clustering Properties of Spatial Preferential Attachment Model
Cited In (6)
- Spectrum of Johnson graphs
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- New lower bound on the modularity of Johnson graphs
- Modularity in planted partition model
- On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular
This page was built for publication: Exact modularity of line graphs of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229338)
