Spectrum of Johnson graphs

DOI10.1016/J.DISC.2022.113262MaRDI QIDQ2111919zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

modularityspectrumJohnson graphsHamiltonicity

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A counterexample to Borsuk’s conjecture
• A note on Hamiltonian circuits
• Asymptotic modularity of some graph classes
• Exact modularity of line graphs of complete graphs
• Forbidding just one intersection
• Gigantic and small components in random distance graphs of special form
• Gigantic component in random distance graphs of special form
• Hamiltonian uniform subset graphs
• Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs
• Intersection theorems with geometric consequences
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Large cycles in random generalized Johnson graphs
• Maximum modular graphs
• Modularity in several random graph models
• Modularity of Erdős-Rényi random graphs
• Modularity of complex networks models
• Modularity of regular and treelike graphs
• Modularity of some distance graphs
• New lower bound on the modularity of Johnson graphs
• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
• On the Shannon capacity of a graph
• Probability Inequalities for Sums of Bounded Random Variables
• Pseudo-random graphs
• Sparse Kneser graphs are Hamiltonian
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• The isoperimetric number of random regular graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Гигантская компонента в случайных дистанционных графах специального вида

Cited in

(8)

• Diameter bounds and recursive properties of Full-Flag Johnson graphs
• Johnson graphs are panconnected
• On the spectra of Johnson graphs
• On the spectrum of the Johnson graphs \(J(n,k,r)\)
• Estimates of the Number of Edges in Subgraphs of Johnson Graphs
• New lower bound on the modularity 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)