Essential connectivity and spectral radius of graphs
From MaRDI portal
Cites work
- l-connectivity, l-edge-connectivity and spectral radius of graphs
- Colorings and spectral radius of digraphs
- Conditional connectivity
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Eigenvalues and colorings of digraphs
- Fault tolerance properties of pyramid networks
- Graph theory with applications
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- Minimum cuts, girth and a spectral threshold
- On graphs with randomly deleted edges
- On the spectral radius of graphs with connectivity at most \(k\)
- On the spectral radius of graphs with cut vertices
- Spectra of digraphs
- Spectral bounds for the connectivity of regular graphs with given order
- Spectral radius and edge‐disjoint spanning trees
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- Spectral radius of digraphs with given dichromatic number
- Spectral radius of strongly connected digraphs
- The connectivity of exchanged hypercubes
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Unoriented Laplacian maximizing graphs are degree maximal
This page was built for publication: Essential connectivity and spectral radius of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831637)
