Bounds of spectral radii on edge-most outer-planar bipartite graphs
From MaRDI portal
Publication:5300063
DOI10.1080/03081087.2012.706291zbMath1268.05127OpenAlexW2069384126MaRDI QIDQ5300063
Yuan Hong, Guanglong Yu, Jin-Long Shu
Publication date: 24 June 2013
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2012.706291
spectral radiusadjacency matrixlargest eigenvaluebounds of spectral radii\( \rho(G) \leq 1 + \sqrt{\frac{n}{2}-1}\)\(\rho(G) < 1 + \sqrt{\frac{n}{2}- \frac{1}{2}}\)\(m(G) = \frac{2}{2}n - 2\)\(m(G) = \frac{3}{2}n - \frac{5}{2}\)edge-most outer-planar bipartite graph
Cites Work
- Unnamed Item
- Graph spectra in computer science
- Network flow interdiction on planar graphs
- Circular planar graphs and resistor networks
- A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs
- Tree-width, clique-minors, and eigenvalues.
- Surfaces, tree-width, clique-minors, and partitions
This page was built for publication: Bounds of spectral radii on edge-most outer-planar bipartite graphs