Pages that link to "Item:Q1124943"

The following pages link to Sharp lower bounds of the least eigenvalue of planar graphs (Q1124943):

Displaying 20 items.

• The least eigenvalue of the complements of trees (Q551342) (← links)
• Ordering unicyclic graphs in terms of their smaller least eigenvalues (Q623640) (← links)
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices (Q690534) (← links)
• Graphs for which the least eigenvalue is minimal. I (Q927768) (← links)
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter (Q965979) (← links)
• The least eigenvalue of a graph with cut vertices (Q972775) (← links)
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (Q979013) (← links)
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices (Q1030728) (← links)
• Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs (Q1035554) (← links)
• Tree-width, clique-minors, and eigenvalues. (Q1421528) (← links)
• Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses (Q1881069) (← links)
• The least eigenvalue of graphs with cut edges (Q1926031) (← links)
• On the least eigenvalue of cacti with pendant vertices (Q1938682) (← links)
• Least eigenvalue of the connected graphs whose complements are cacti (Q2111705) (← links)
• On the second minimizing graph in the set of complements of trees (Q2176151) (← links)
• The least eigenvalue of graphs whose complements are unicyclic (Q2344012) (← links)
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic (Q2358245) (← links)
• (Q3299333) (← links)
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles (Q4633701) (← links)
• (Q6198983) (← links)