Spectrum of Johnson graphs

DOI10.1016/J.DISC.2022.113262OpenAlexW4310367061MaRDI QIDQ2111919FDOQ2111919

Mikhail M. Koshelev

Publication date: 17 January 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113262

Recommendations

• On the spectrum of the Johnson graphs \(J(n,k,r)\)
• Large cycles in random generalized Johnson graphs
• Pseudo-random graphs
• On the spectra of Johnson graphs
• Bounds on graph spectra

zbMATH Keywords

modularityspectrumJohnson graphsHamiltonicity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• On the Shannon capacity of a graph
• Forbidding just one intersection
• Intersection theorems with geometric consequences
• A counterexample to Borsuk’s conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on Hamiltonian circuits
• Modularity in several random graph models
• Modularity of complex networks models
• Title not available (Why is that?)
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• The isoperimetric number of random regular graphs
• Pseudo-random graphs
• Asymptotic Modularity of Some Graph Classes
• Hamiltonian uniform subset graphs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• Modularity of regular and treelike graphs
• Modularity of Erdős‐Rényi random graphs
• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
• Exact modularity of line graphs of complete graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Gigantic component in random distance graphs of special form
• Gigantic and small components in random distance graphs of special form
• Sparse Kneser graphs are Hamiltonian
• Modularity of some distance graphs
• Large cycles in random generalized Johnson graphs
• New lower bound on the modularity of Johnson graphs
• Maximum modular graphs
• Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs
• Гигантская компонента в случайных дистанционных графах специального вида

Cited In (5)

• Johnson graphs are panconnected
• On the spectra of Johnson graphs
• Estimates of the Number of Edges in Subgraphs of Johnson Graphs
• Modularity in planted partition model
• On reconstruction of eigenfunctions of Johnson graphs

This page was built for publication: Spectrum of Johnson graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111919)