Modularity of some distance graphs
From MaRDI portal
Publication:2243703
DOI10.1134/S1064562420010147zbMath1477.05060OpenAlexW3027139291MaRDI QIDQ2243703
Mikhail M. Koshelev, M. M. Ipatov, Andrei M. Raigorodskii
Publication date: 11 November 2021
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562420010147
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Distance in graphs (05C12)
Related Items (9)
Modularity in planted partition model ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ New lower bound on the modularity of Johnson graphs ⋮ On stability of the independence number of a certain distance graph ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ New Turán type bounds for Johnson graphs ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ Spectrum of Johnson graphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Families of sets with no matchings of sizes 3 and 4
- Modularity in several random graph models
- Clustering coefficient of a spatial preferential attachment model
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On lower bounds for the chromatic number of spheres
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- The number of edges in induced subgraphs of some distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- Panchromatic 3-colorings of random hypergraphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Partition‐free families of sets
- Clustering Properties of Spatial Preferential Attachment Model
This page was built for publication: Modularity of some distance graphs
