Minimally $(k,k)$-edge-connected graphs via spectral radius

Documents similaires

• A note on the spectral radius and $[a,b]$-factor of graphs
  par: Fan, Dandan, et autres
  Publié: (2025)
• Sufficient conditions of $k$-leaf-connected graphs and spanning trees with bounded total $k$-excess
  par: Ao, Guoyan, et autres
  Publié: (2025)
• Sufficient spectral conditions for graphs being $k$-edge-Hamiltonian or $k$-Hamiltonian
  par: Li, Yongtao, et autres
  Publié: (2021)
• A unified approach to the spectral radius, connectivity and edge-connectivity of graphs
  par: Wang, Yu, et autres
  Publié: (2024)
• Non-existence of co-spectral simple connected graphs with small number of edges
  par: Boyko, O., et autres
  Publié: (2025)