Spectrum of Johnson graphs
From MaRDI portal
Publication:2111919
DOI10.1016/j.disc.2022.113262OpenAlexW4310367061MaRDI QIDQ2111919
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Forbidding just one intersection
- Hamiltonian uniform subset graphs
- The isoperimetric number of random regular graphs
- Intersection theorems with geometric consequences
- Modularity in several random graph models
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
- Kneser graphs are Hamiltonian for \(n\geq 3k\)
- Gigantic component in random distance graphs of special form
- Gigantic and small components in random distance graphs of special form
- Modularity of complex networks models
- Large cycles in random generalized 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
- New lower bound on the modularity of Johnson graphs
- Modularity of some distance graphs
- A note on Hamiltonian circuits
- Asymptotic Modularity of Some Graph Classes
- A counterexample to Borsuk’s conjecture
- Modularity of regular and treelike graphs
- On the Shannon capacity of a graph
- The emergence of a giant component in random subgraphs of pseudo-random graphs
- Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs
- Modularity of Erdős‐Rényi random graphs
- Sparse Kneser graphs are Hamiltonian
- Гигантская компонента в случайных дистанционных графах специального вида
- Probability Inequalities for Sums of Bounded Random Variables
- Maximum modular graphs
This page was built for publication: Spectrum of Johnson graphs
