The largest eigenvalue of a graph: A survey

DOI10.1080/03081089008818026zbMATH Open0744.05031OpenAlexW2074422414MaRDI QIDQ4713877FDOQ4713877

P. Rowlinson, Dragoš Cvetković

Publication date: 25 June 1992

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089008818026

zbMATH Keywords

largest eigenvalue of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The second largest eigenvalue of a tree
• A Survey on Spectra of infinite Graphs
• On the spectral radius of (0,1)-matrices
• The limit points of eigenvalues of graphs
• On the distribution of the maximum eigenvalues of graphs
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• k-Degenerate Graphs
• Recent results in the theory of graph spectra
• Spektren endlicher Grafen
• Methods of intermediate problems for eigenvalues. Theory and ramifications
• More on Graph Perturbations
• On Angles and Perturbations of Graphs
• Spectra of unicyclic graphs
• A bound on the spectral radius of graphs
• On the index of tricyclic Hamiltonian graphs
• Lower bounds on the number of triangles in a graph
• Lower bounds for the clique and the chromatic numbers of a graph
• On the maximal index of graphs with a prescribed number of edges
• Spectral conditions for the reconstructibility of a graph
• The Spectral Radius of infinite Graphs
• Spectral bounds for the clique and independence numbers of graphs
• Spectral Radius and Degree Sequence
• The Eigenvalues of a Graph and Its Chromatic Number
• Spektren periodischer Graphen
• Line graphs, root systems, and elliptic geometry
• Upper Bounds on the Order of a Clique of a Graph
• On the eigenvalues of trees
• A bound on the spectral radius of graphs with \(e\) edges
• Bounds on the spectral radius of graphs with e edges
• A deletion-contraction algorithm for the characteristic polynomial of a multigraph
• The Number of Words of Length n in a Graph Monoid
• Nested bounds for the Perron root of a nonnegative matrix
• On the maximum eigenvalue of a reducible non-negative real matrix
• Computing and interpreting the adjacency spectrum of traffic networks
• On Hamiltonian graphs with maximal index
• The change in index of a graph resulting from the attachment of a pendant edge

Cited In (only showing first 100 items - show all)

• On the least eigenvalue of cacti with pendant vertices
• Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
• The spectral radius of tricyclic graphs with \(n\) vertices and \(k\) pendent vertices
• On groups generated by two positive multi-twists: Teichmüller curves and Lehmer's number
• Bounding the largest eigenvalue of trees in terms of the largest vertex degree
• Cyclotomic factors of Coxeter polynomials
• The least eigenvalue of graphs whose complements are unicyclic
• On the spectral radius of tricyclic graphs with a maximum matching
• Further results on the least eigenvalue of connected graphs
• Some upper bounds on the spectral radius of a graph
• The efficiency and stability of R\&D networks
• Connected graphs of fixed order and size with maximal index: some spectral bounds
• The new upper bounds on the spectral radius of weighted graphs
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• Thermodynamic metrics on outer space
• On the minimum real roots of the adjoint polynomial of a graph
• Some results on the index of unicyclic graphs
• On the spectral radius of bicyclic graphs with \(n\) vertices and diameter \(d\)
• Graphs for which the least eigenvalue is minimal. I
• On the spectral radius of unicyclic graphs with perfect matchings
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
• A sharp upper bound on the spectral radius of weighted graphs
• Nestedness in networks: A theoretical model and some applications
• Cyclotomic matrices over real quadratic integer rings
• On the least eigenvalue of cacti
• On the index of broken wheels
• Matrix power inequalities and the number of walks in graphs
• On the spectral radius of graphs with cut vertices
• On the index of bicyclic graphs with perfect matchings
• On the index of tricyclic graphs with perfect matchings
• On the spectral radius of graphs with cut edges
• The least eigenvalue of graphs with cut edges
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• Emergence of synchronization in complex networks of interacting dynamical systems
• The spectra of polynomial equations with varying exponents
• The distribution of eigenvalues of graphs
• Bounds of eigenvalues of graphs
• Limit points of eigenvalues of (di)graphs
• Least eigenvalue of the connected graphs whose complements are cacti
• The spectral radius of a planar graph
• On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
• The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• An index theory for uniformly locally finite graphs
• Ordering trees by their spectral radii
• On the spectral radius of unicyclic graphs with fixed diameter
• Ordering graphs with small index and its application
• Some Inequalities for the Largest Eigenvalue of a Graph
• Trees with minimal index and diameter at most four
• The spectral radius of graphs on surfaces
• Title not available (Why is that?)
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree
• The least eigenvalue of the complements of trees
• Bounds on the largest eigenvalues of trees with a given size of matching
• The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
• Maximum degree and minimum degree spectral radii of some graph operations
• Bicyclic graphs for which the least eigenvalue is minimum
• The least eigenvalue of a graph with cut vertices
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• Sharp upper bounds of the spectral radius of a graph
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Inequalities for the number of walks in graphs
• The index of a periodic graph
• The cospectral equivalence classes of graphs having an isolated vertex
• Complex network approach to fractional time series
• Digraphs and cycle polynomials for free-by-cyclic groups
• On the spread of outerplanar graphs
• Graph theoretic aspects of maximizing the spectral radius of nonnegative matrices
• Spectral extrema of 1-planar graphs
• Open problems in the spectral theory of signed graphs
• A decreasing sequence of upper bounds for the Perron root
• \textit{SDD} spectral radii and \textit{SDD} energies of graph operations
• On the spectral radius of bipartite graphs which are nearly complete
• On the second minimizing graph in the set of complements of trees
• Could network analysis of horizontal visibility graphs be faithfully used to infer long-term memory properties in real-world time series?
• On the \(\alpha\)-index of minimally 2-connected graphs with given order or size
• Spectral ordering of trees with small index
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• Upper bounds on the smallest positive eigenvalue of trees
• Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses
• Sharp bounds for the spectral radius of nonnegative matrices
• The distinct roles of initial transmission and retransmission in the persistence of knowledge in complex networks
• On the spectral radius of tricyclic graphs with a fixed diameter
• Spectral Radius of Graphs
• Fast Cluster Detection in Networks by First Order Optimization
• Social network formation and strategic interaction in large networks
• Pairwise stable networks in homogeneous societies with weak link externalities
• Maximum spread of \(K_{2,t}\)-minor-free graphs
• On the maximum spread of planar and outerplanar graphs
• Spectral extremal graphs without intersecting triangles as a minor
• Three conjectures in extremal spectral graph theory
• Transfer-matrix methods meet Ehrhart theory
• Tricylic hamiltonian graphs with minimal index
• A complete solution to the Cvetković–Rowlinson conjecture
• Maximum spectral radius of outerplanar 3‐uniform hypergraphs
• The spectral radius for a class of double-star-like tree systems with maximal degree 4
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• Bounds on the ABC spectral radius of a tree
• On the N-spectrum of oriented graphs
• Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait

This page was built for publication: The largest eigenvalue of a graph: A survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713877)