On the eigenvalues of trees
From MaRDI portal
Publication:2555861
DOI10.1007/BF02018473zbMath0247.05108MaRDI QIDQ2555861
Publication date: 1973
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Related Items
Ordering graphs with small index and its application ⋮ On the spectral radius of graphs with connectivity at most \(k\) ⋮ Branching in graphs and molecules ⋮ The Estrada index of chemical trees ⋮ Unnamed Item ⋮ Novel results on partial Hosoya polynomials: an application in chemistry ⋮ On the eigenvalues and spectral radius of starlike trees ⋮ On the spectral radius of graphs without a star forest ⋮ On the zeros of the partial Hosoya polynomial of graphs ⋮ Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ Use of the Szeged index and the revised Szeged index for measuring network bipartivity ⋮ On spectral radius of graphs with pendant paths ⋮ Spectral norm of oriented graphs ⋮ Two new topological indices based on graph adjacency matrix eigenvalues and eigenvectors ⋮ On spectral radii of unraveled balls ⋮ The extremal spectral radius of generalized block graphs ⋮ Technical Note—Revenue Volatility Under Uncertain Network Effects ⋮ A calculus for measuring the elegance of abstract graphs ⋮ Extremal problems for the eccentricity matrices of complements of trees ⋮ Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs ⋮ On the spectral radius of tricyclic graphs with a maximum matching ⋮ Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\) ⋮ Unicyclic graphs of minimal spectral radius ⋮ Skew-adjacency matrices of graphs ⋮ On the \(p\)-Schatten energy of bipartite graphs ⋮ Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ Relationship between Ordinary, Laplacian, Randić, Incidence, and Sombor Energies of Trees ⋮ A spectral extremal problem on non-bipartite triangle-free graphs ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Eigenvalues of neutral networks: interpolating between hypercubes ⋮ On numerical characterization of proteomics maps based on partitioning of 2-D maps into Voronoi regions ⋮ Graphs with small second largest Laplacian eigenvalue ⋮ On the roots of edge cover polynomials of graphs ⋮ Graph homomorphisms between trees ⋮ Study of proteome maps using partial ordering ⋮ On the maximal index of connected graphs ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ A reduction formula for the characteristic polynomial of hypergraph with pendant edges ⋮ On the spectral radius of block graphs with prescribed independence number \(\alpha\) ⋮ Spectral extremal results with forbidding linear forests ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ Ordering trees by the spectral radius of Laplacian ⋮ Growth rates of geometric grid classes of permutations ⋮ Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix ⋮ Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\) ⋮ On the \(A_{\alpha}\)-spectra of trees ⋮ The matching polynomials and spectral radii of uniform supertrees ⋮ Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices ⋮ Variable neighborhood search for extremal graphs 3 ⋮ On a poset of trees ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ Partially ordering the class of invertible trees ⋮ On the largest eigenvalues of trees with perfect matchings ⋮ Rank of Hadamard powers of Euclidean distance matrices ⋮ On a poset of trees revisited ⋮ Automorphism group and category of cospectral graphs ⋮ Majorization and the spectral radius of starlike trees ⋮ Uniform supertrees with extremal spectral radii ⋮ Distance matrix polynomials of trees ⋮ Coxeter energy of graphs ⋮ Trees with given maximum degree minimizing the spectral radius ⋮ Graph functions maximized on a path ⋮ On the spectral radius of block graphs having all their blocks of the same size ⋮ Extremal problems involving the two largest complementarity eigenvalues of a graph ⋮ The largest eigenvalue of a graph: A survey ⋮ On the inverse and the dual index of a tree ⋮ Characterizing attitudinal network graphs through frustration cloud ⋮ A relation between a vertex-degree-based topological index and its energy ⋮ Nontransitive Random Variables and Nontransitive Dice ⋮ On the index of bicyclic graphs with perfect matchings ⋮ Energy of a digraph with respect to a VDB topological index ⋮ Quantitative graph theory: a new branch of graph theory and network science ⋮ On a Poset of Trees II ⋮ Growth rates of permutation grid classes, tours on graphs, and the spectral radius ⋮ Computing the characteristic polynomial of a tree ⋮ Computers and discovery in algebraic graph theory ⋮ Inverses of trees ⋮ On a conjecture about the spectral radius of block graphs ⋮ Bounding the largest eigenvalue of trees in terms of the largest vertex degree ⋮ Fisher information and synchronisation transitions: a case-study of a finite size multi-network Kuramoto-Sakaguchi system
Cites Work
