Bounds of spectral radii on edge-most outer-planar bipartite graphs
From MaRDI portal
(Redirected from Publication:5300063)
Recommendations
Cites work
- A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs
- Circular planar graphs and resistor networks
- Graph spectra in computer science
- Graph theory with applications
- Network flow interdiction on planar graphs
- Surfaces, tree-width, clique-minors, and partitions
- Tree-width, clique-minors, and eigenvalues.
Cited in
(3)
This page was built for publication: Bounds of spectral radii on edge-most outer-planar bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300063)