Spectral threshold for extremal cyclic edge-connectivity
From MaRDI portal
Publication:2053673
DOI10.1007/S00373-021-02333-6OpenAlexW3166363355MaRDI QIDQ2053673FDOQ2053673
Authors: Yanyan Li 
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.02393
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic Graph Theory
- Extraconnectivity of graphs with large girth
- Conditional connectivity
- A Separator Theorem for Planar Graphs
- Title not available (Why is that?)
- On n-extendable graphs
- Disconnecting strongly regular graphs
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- The Moore bound for irregular graphs
- Title not available (Why is that?)
- Some Results Concerning the Structure of Graphs
- Title not available (Why is that?)
- Integer flows and cycle covers
- On cyclic edge-connectivity of transitive graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- Eigenvalues and edge-connectivity of regular graphs
- The existence and upper bound for two types of restricted connectivity
- On several sorts of connectivity
- Characterization of graphs with infinite cyclic edge connectivity
- An efficient algorithm for cyclic edge connectivity of regular graphs.
- The cyclic edge-connectivity of strongly regular graphs
- Spectral bounds for the connectivity of regular graphs with given order
Cited In (1)
This page was built for publication: Spectral threshold for extremal cyclic edge-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053673)
