Bounds of spectral radii on edge-most outer-planar bipartite graphs (Q5300063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular planar graphs and resistor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spectra in computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surfaces, tree-width, clique-minors, and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, clique-minors, and eigenvalues. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow interdiction on planar graphs / rank
 
Normal rank

Latest revision as of 14:21, 6 July 2024

scientific article; zbMATH DE number 6180256
Language Label Description Also known as
English
Bounds of spectral radii on edge-most outer-planar bipartite graphs
scientific article; zbMATH DE number 6180256

    Statements

    Bounds of spectral radii on edge-most outer-planar bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    largest eigenvalue
    0 references
    adjacency matrix
    0 references
    spectral radius
    0 references
    edge-most outer-planar bipartite graph
    0 references
    bounds of spectral radii
    0 references
    \(m(G) = \frac{2}{2}n - 2\)
    0 references
    \(m(G) = \frac{3}{2}n - \frac{5}{2}\)
    0 references
    \( \rho(G) \leq 1 + \sqrt{\frac{n}{2}-1}\)
    0 references
    \(\rho(G) < 1 + \sqrt{\frac{n}{2}- \frac{1}{2}}\)
    0 references

    Identifiers