New lower bound on the modularity of Johnson graphs
M Koshelev - Moscow Journal of Combinatorics and Number Theory, 2021 - msp.org
New lower bound on the modularity of Johnson graphs Page 1 2021 vol. 10 no. 1 New lower
bound on the modularity of Johnson graphs Mikhail Koshelev Page 2 msp Moscow Journal of …
bound on the modularity of Johnson graphs Mikhail Koshelev Page 2 msp Moscow Journal of …
Exact modularity of line graphs of complete graphs
M Ipatov - Moscow Journal of Combinatorics and Number Theory, 2021 - msp.org
Modularity is designed to measure the strength of a division of a network into clusters. For
n∈ ℕ, consider a set S of n elements. Let V be the set of all subsets of S of size r. Consider …
n∈ ℕ, consider a set S of n elements. Let V be the set of all subsets of S of size r. Consider …
On the chromatic number of the preferential attachment graph
L Lichev - European Journal of Combinatorics, 2021 - Elsevier
We prove that for every m∈ N and every δ∈(− m, 0), the chromatic number of the
preferential attachment graph PA t (m, δ) is asymptotically almost surely equal to m+ 1. The …
preferential attachment graph PA t (m, δ) is asymptotically almost surely equal to m+ 1. The …
Lower bounds on the clique-chromatic numbers of some distance graphs
MM Koshelev - Moscow Journal of Combinatorics and Number Theory, 2021 - msp.org
Lower bounds on the clique-chromatic numbers of some distance graphs Page 1 2021 vol.
10 no. 2 Lower bounds on the clique-chromatic numbers of some distance graphs Mikhail M …
10 no. 2 Lower bounds on the clique-chromatic numbers of some distance graphs Mikhail M …