The p-restricted edge-connectivity of Kneser graphs

DOI10.1016/J.AMC.2018.09.072MaRDI QIDQ2008197zbMATH OpenOpenAlexWikidataFDO

Authors C. 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

zbMATH Keywords

Kneser graphsrestricted edge connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the \(p\)-restricted edge connectivity of the bipartite Kneser graph \(H(n,k)\)
• A sufficient condition for graphs to be super \(k\)-restricted edge connected
• Super restricted edge connectivity of regular graphs
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• The k-restricted edge connectivity of balanced bipartite graphs

Cites work

• scientific article; zbMATH DE number 3478938 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 2059939 (Why is no real title available?)
• A bound on 4-restricted edge connectivity of graphs
• A mixed version of Menger's theorem
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Chromatic number and the 2-rank of a graph
• Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
• Edge-cuts leaving components of order at least three
• Eigenvalues and perfect matchings
• Erdős-Ko-Rado theorems. Algebraic approaches
• Extraconnectivity of graphs with large girth
• Extraconnectivity of graphs with large minimum degree and girth
• Hamiltonian uniform subset graphs
• Kneser's conjecture, chromatic number, and homotopy
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Mixed connectivity of random graphs
• On a kind of reliability analysis of networks
• On extra connectivity and extra edge-connectivity of balanced hypercubes
• On the diameter of Kneser graphs
• On the extraconnectivity of graphs
• Proofs from THE BOOK
• Regular graphs. A spectral approach
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Super edge-connectivity of dense digraphs and graphs
• The \(g\)-extra connectivity and diagnosability of crossed cubes
• The \(k\)-restricted edge-connectivity of a product of graphs
• The super-connectivity of Kneser graphs
• k-restricted edge connectivity in (p+1)-clique-free graphs
• \(k\)-restricted edge-connectivity in triangle-free graphs

Cited in

(8)

• scientific article; zbMATH DE number 7085090 (Why is no real title available?)
• On the super (edge)-connectivity of generalized Johnson graphs
• \(k\)-restricted edge-connectivity in triangle-free graphs
• The k-restricted edge connectivity of undirected Kautz graphs
• Cuts leaving components of given minimum order
• On the \(p\)-restricted edge connectivity of the bipartite Kneser graph \(H(n,k)\)
• scientific article; zbMATH DE number 2245640 (Why is no real title available?)
• scientific article; zbMATH DE number 2121669 (Why is no real title available?)

This page was built for publication: The \(p\)-restricted edge-connectivity of Kneser graphs

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