New lower bound on the modularity of Johnson graphs
From MaRDI portal
Publication:2229339
DOI10.2140/MOSCOW.2021.10.77zbMATH Open1459.05264OpenAlexW3123719452MaRDI QIDQ2229339FDOQ2229339
Authors: Mikhail M. Koshelev 
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.77
Recommendations
Cites Work
- 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
- Title not available (Why is that?)
- General results on preferential attachment and clustering coefficient
- Random Kneser graphs and hypergraphs
- Exact modularity of line graphs of complete graphs
- On a Frankl-Wilson theorem
- 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\)
- Clustering coefficient of a spatial preferential attachment model
- New bounds on clique-chromatic numbers of Johnson graphs
- On the independence number and the chromatic number of generalized preferential attachment models
- Modularity of some distance graphs
- 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
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)
