Pages that link to "Item:Q4713877"

The following pages link to The largest eigenvalue of a graph: A survey (Q4713877):

Displaying 50 items.

• The spectra of polynomial equations with varying exponents (Q321405) (← links)
• Inequalities for the number of walks in graphs (Q378237) (← links)
• Matrix power inequalities and the number of walks in graphs (Q403573) (← links)
• On the spectral radius of tricyclic graphs with a maximum matching (Q414685) (← links)
• The efficiency and stability of R\&D networks (Q423746) (← links)
• The new upper bounds on the spectral radius of weighted graphs (Q426550) (← links)
• Cyclotomic matrices over real quadratic integer rings (Q448375) (← links)
• Ordering trees by their spectral radii (Q477575) (← links)
• The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges (Q497342) (← links)
• Further results on the least eigenvalue of connected graphs (Q549290) (← links)
• On the least eigenvalue of cacti (Q550609) (← links)
• The least eigenvalue of the complements of trees (Q551342) (← links)
• Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices (Q677122) (← links)
• On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree (Q782328) (← links)
• Spectral clustering of combinatorial fullerene isomers based on their facet graph structure (Q830874) (← links)
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
• Emergence of synchronization in complex networks of interacting dynamical systems (Q858516) (← links)
• On the spectral radius of unicyclic graphs with fixed diameter (Q861007) (← links)
• On the spectral radius of bicyclic graphs with \(n\) vertices and diameter \(d\) (Q869921) (← links)
• The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices (Q924338) (← links)
• Graphs for which the least eigenvalue is minimal. I (Q927768) (← links)
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
• A sharp upper bound on the spectral radius of weighted graphs (Q932586) (← links)
• Connected graphs of fixed order and size with maximal index: some spectral bounds (Q962125) (← links)
• The cospectral equivalence classes of graphs having an isolated vertex (Q971680) (← links)
• The least eigenvalue of a graph with cut vertices (Q972775) (← links)
• Trees with minimal index and diameter at most four (Q973144) (← links)
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (Q979013) (← links)
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph (Q984856) (← links)
• On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1 (Q998477) (← links)
• Bicyclic graphs for which the least eigenvalue is minimum (Q999810) (← links)
• Cyclotomic factors of Coxeter polynomials (Q1017386) (← links)
• An index theory for uniformly locally finite graphs (Q1019627) (← links)
• On the index of tricyclic graphs with perfect matchings (Q1039740) (← links)
• On the minimum real roots of the adjoint polynomial of a graph (Q1044000) (← links)
• The spectral radius of a planar graph (Q1260973) (← links)
• Bounds of eigenvalues of graphs (Q1313968) (← links)
• The index of a periodic graph (Q1329584) (← links)
• A decreasing sequence of upper bounds for the Perron root (Q1339809) (← links)
• Bounds on the largest eigenvalues of trees with a given size of matching (Q1347942) (← links)
• On the spectral radius of unicyclic graphs with perfect matchings (Q1405041) (← links)
• The spectral radius of graphs on surfaces (Q1569068) (← links)
• Ordering graphs with small index and its application (Q1613408) (← links)
• Transfer-matrix methods meet Ehrhart theory (Q1644957) (← links)
• The spectral radius for a class of double-star-like tree systems with maximal degree 4 (Q1665942) (← links)
• The distribution of eigenvalues of graphs (Q1805227) (← links)
• On the index of bicyclic graphs with perfect matchings (Q1827770) (← links)
• On the spectral radius of graphs with cut vertices (Q1850564) (← links)
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree (Q1863520) (← links)
• Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses (Q1881069) (← links)