Extremal problems on saturation for the family of $k$-edge-connected graphs
From MaRDI portal
Publication:1741522
DOI10.1016/j.dam.2019.01.009zbMath1409.05115arXiv1710.07432OpenAlexW2796218424MaRDI QIDQ1741522
Suil O, Xuding Zhu, Yongtang Shi, Hui Lei, Douglas B. West
Publication date: 3 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.07432
Related Items
The partite saturation number of spider ⋮ Weak saturation number of a complete bipartite graph ⋮ The multiplicities of eigenvalues of a graph
Cites Work
- Unnamed Item
- A survey of minimum saturated graphs
- Spectra of graphs
- Eigenvalues and edge-connectivity of regular graphs
- A note on the saturation number of the family of \(k\)-connected graphs
- A Problem in Graph Theory
- On graphs with equal algebraic and vertex connectivity
- Edge-connectivity in regular multigraphs from eigenvalues