Recent results in the theory of graph spectra
zbMATH Open0634.05054MaRDI QIDQ1210719
Aleksandar Torgašev, Ivan Gutman, Dragoš Cvetković, Michael Doob
Publication date: 5 June 1993
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
least eigenvaluestrongly regular graphsrandom graphsgraph polynomialsgraph spectrachemistrydistance- regular graphs[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=H%EF%BF%BD%EF%BF%BDckel+molecular+orbital+theory&go=Go H��ckel molecular orbital theory]matching polyomialspectra of infinite graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)
Cited In (only showing first 100 items - show all)
- The inertia and energy of the distance matrix of a connected graph
- Some results on chemical energy of graphs
- Functions on adjacent vertex degrees of trees with given degree sequence
- Some properties on Estrada index of folded hypercubes networks
- Energy of generalized line graphs
- Spectra of uniform hypergraphs
- Sharp bounds for the signless Laplacian spectral radius of digraphs
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- A note on the irregularity of graphs
- Star complements and connectivity in finite graphs
- \(\ell_ 1\)-rigid graphs
- Characteristic polynomial of catacondensed systems
- The minimum matching energy of bicyclic graphs with given girth
- Ordering trees by the Laplacian coefficients
- The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
- The maximal exceptional graphs
- Upper and lower bounds for the energy of bipartite graphs.
- Graph spectra in computer science
- Graphs for which the least eigenvalue is minimal. I
- Laplacian matrices of graphs: A survey
- Sharp bounds for the spectral radius of digraphs
- On the distance spectral radius of bipartite graphs
- Improved upper and lower bounds for the spectral radius of digraphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- The majorization theorem of connected graphs
- The matching energy of a graph
- The matching energy of graphs with given parameters
- On the spectral moments of unicyclic graphs with fixed diameter
- The spectral moments of trees with given maximum degree
- Unicyclic graphs with maximal energy
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Some results on graph spectra
- The independence polynomial of rooted products of graphs
- On the spectra of simplicial rook graphs
- On the spectral moment of quasi-trees
- The majorization theorem for signless Laplacian spectral radii of connected graphs
- The largest eigenvalue of a graph: A survey
- Graphs with least eigenvalue \(-2\): The star complement technique
- A unified approach to the first derivatives of graph polynomials
- Laplace eigenvalues of graphs---a survey
- On the least eigenvalue of cacti
- Old and new results on algebraic connectivity of graphs
- Further results on permanental bounds for the Laplacian matrix of trees
- Pick's inequality and tournaments
- Distance spectra of graphs: a survey
- Spectra of unicyclic graphs
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- On the third largest eigenvalue of a graph
- Lower bounds for Gaussian Estrada index of graphs
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Bounds of eigenvalues of graphs
- Centrosymmetric graphs and a lower bound for graph energy of fullerenes
- On the smallest eigenvalues of the line graphs of some trees
- On the geometry and Laplacian of a graph
- On strongly asymmetric and controllable primitive graphs
- The Estrada index of evolving graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- Graph Laplacians, nodal domains, and hyperplane arrangements
- On the largest eigenvalue of non-regular graphs
- Characterizing trees with large Laplacian energy
- Faber-Krahn type inequalities for trees
- Factoring distance matrix polynomials
- Asymptotic spectral distributions of Manhattan products of \(C_{n}\sharp P_{m}\)
- On the signless Laplacian coefficients of unicyclic graphs
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- The matching energy of graphs with given edge connectivity
- Indistinguishable trees and graphs
- On graphs with exactly one eigenvalue less than -1
- The distance matrices of some graphs related to wheel graphs
- On eigenvalue multiplicity and the girth of a graph
- The inertia of distance matrices of some graphs
- Some relations between rank, chromatic number and energy of graphs
- Construction of graphs with distinct eigenvalues
- Schrödinger operators on periodic discrete graphs
- Graphs for small multiprocessor interconnection networks
- On the second largest distance eigenvalue
- On the Laplacian spectrum of an infinite graph
- Inequalities for the number of walks in graphs
- Quasi-Random Set Systems
- Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- The number of spanning trees of plane graphs with reflective symmetry
- On trees as star complements in regular graphs
- Gelfand's inverse problem for the graph Laplacian
- General Theory of Cycle-Dependence of Total pi-Electron Energy
- Ordering trees with algebraic connectivity and diameter
- The changes in indices of modified graphs
- On the k-matchings of the complements of bicyclic graphs
- Indefinite eigenvalue problems for \(p\)-Laplacian operators with potential terms on networks
- On the largest matching roots of graphs with a given number of pendent vertices
- The truncation of a cage graph
- On the largest matching roots of graphs with cut edges
- Spectra of large random trees
- On multiplicity of eigenvalues in quantum graph theory
- MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS
- On ordering of complements of graphs with respect to matching numbers
- Title not available (Why is that?)
- Computers and discovery in algebraic graph theory
- The matching polynomials of hypergraphs and weighted hypergraphs
This page was built for publication: Recent results in the theory of graph spectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210719)