The \(p\)-restricted edge-connectivity of Kneser graphs
From MaRDI portal
Publication:2008197
DOI10.1016/j.amc.2018.09.072zbMath1428.05257OpenAlexW2896381901MaRDI QIDQ2008197
Camino Balbuena, Xavier Marcote
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.09.072
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-restricted edge-connectivity in triangle-free graphs
- On a kind of reliability analysis of networks
- \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
- Regular graphs. A spectral approach
- Kneser's conjecture, chromatic number, and homotopy
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- Hamiltonian uniform subset graphs
- A mixed version of Menger's theorem
- Super edge-connectivity of dense digraphs and graphs
- Extraconnectivity of graphs with large girth
- Extraconnectivity of graphs with large minimum degree and girth
- The super-connectivity of Kneser graphs
- Mixed connectivity of random graphs
- The \(k\)-restricted edge-connectivity of a product of graphs
- Eigenvalues and perfect matchings
- Edge-cuts leaving components of order at least three
- Chromatic number and the 2-rank of a graph
- On the extraconnectivity of graphs
- The \(g\)-extra connectivity and diagnosability of crossed cubes
- A bound on 4-restricted edge connectivity of graphs
- On extra connectivity and extra edge-connectivity of balanced hypercubes
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- On the diameter of Kneser graphs
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Proofs from THE BOOK
