New lower bound on the modularity of Johnson graphs
From MaRDI portal
(Redirected from Publication:2229339)
Recommendations
Cites work
- scientific article; zbMATH DE number 5218478 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- Around Borsuk's hypothesis
- Clustering coefficient of a spatial preferential attachment model
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Exact modularity of line graphs of complete graphs
- General results on preferential attachment and clustering coefficient
- Intersection theorems with geometric consequences
- Modularity in several random graph models
- Modularity of complex networks models
- Modularity of some distance graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- On a Frankl-Wilson theorem
- On the chromatic number of random subgraphs of a certain distance graph
- On the independence number and the chromatic number of generalized preferential attachment models
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Random Kneser graphs and hypergraphs
- The Borsuk partition problem: the seventieth anniversary
- The isoperimetric number of random regular graphs
Cited in
(7)- Spectrum of Johnson graphs
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- Exact modularity of line graphs of complete graphs
- Clustering integrated fusion model based on the maximum matching problem
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- Decomposition of the Johnson graphs into graph-pairs of order 4
- New Turán type bounds for Johnson graphs
This page was built for publication: New lower bound on the modularity of Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229339)
