Spectral threshold for extremal cyclic edge-connectivity

DOI10.1007/s00373-021-02333-6OpenAlexW3166363355MaRDI QIDQ2053673

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

zbMATH Keywords

cyclic edge connectivitygraph spectrumedge connectivity

Mathematics Subject Classification ID

Graph theory (05Cxx) Algebraic combinatorics (05Exx) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On several sorts of connectivity
• On a conjecture of Brouwer involving the connectivity of strongly regular graphs
• The existence and upper bound for two types of restricted connectivity
• On cyclic edge-connectivity of transitive graphs
• Eigenvalues and edge-connectivity of regular graphs
• On n-extendable graphs
• Integer flows and cycle covers
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• Extraconnectivity of graphs with large girth
• The Moore bound for irregular graphs
• The cyclic edge-connectivity of strongly regular graphs
• Characterization of graphs with infinite cyclic edge connectivity
• Disconnecting strongly regular graphs
• Conditional connectivity
• A Separator Theorem for Planar Graphs
• Algebraic Graph Theory
• Spectral Bounds for the Connectivity of Regular Graphs with Given Order
• Some Results Concerning the Structure of Graphs

This page was built for publication: Spectral threshold for extremal cyclic edge-connectivity