The p-restricted edge-connectivity of Kneser graphs

DOI10.1016/J.AMC.2018.09.072zbMATH Open1428.05257OpenAlexW2896381901WikidataQ129086572 ScholiaQ129086572MaRDI QIDQ2008197FDOQ2008197

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

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

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)

Cites Work

• Title not available (Why is that?)
• Chromatic number and the 2-rank of a graph
• On the diameter of Kneser graphs
• Extraconnectivity of graphs with large girth
• The \(k\)-restricted edge-connectivity of a product of graphs
• On the extraconnectivity of graphs
• Kneser's conjecture, chromatic number, and homotopy
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Erdős-Ko-Rado theorems. Algebraic approaches
• Title not available (Why is that?)
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Edge-cuts leaving components of order at least three
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Title not available (Why is that?)
• Proofs from THE BOOK
• Extraconnectivity of graphs with large minimum degree and girth
• Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
• Hamiltonian uniform subset graphs
• Eigenvalues and perfect matchings
• \(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
• A bound on 4-restricted edge connectivity of graphs
• Regular graphs. A spectral approach
• Super edge-connectivity of dense digraphs and graphs
• A mixed version of Menger's theorem
• The super-connectivity of Kneser graphs
• The \(g\)-extra connectivity and diagnosability of crossed cubes
• Mixed connectivity of random graphs
• On extra connectivity and extra edge-connectivity of balanced hypercubes

Cited In (8)

• 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)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)