The following pages link to On the eigenvalues of trees (Q2555861):
Displaying 50 items.
- On the spectral radius of tricyclic graphs with a maximum matching (Q414685) (← links)
- Skew-adjacency matrices of graphs (Q417551) (← links)
- Graph homomorphisms between trees (Q463048) (← links)
- Growth rates of geometric grid classes of permutations (Q490266) (← links)
- On the \(A_{\alpha}\)-spectra of trees (Q513238) (← links)
- On a poset of trees (Q532127) (← links)
- On the largest eigenvalues of trees with perfect matchings (Q551881) (← links)
- Use of the Szeged index and the revised Szeged index for measuring network bipartivity (Q608277) (← links)
- On numerical characterization of proteomics maps based on partitioning of 2-D maps into Voronoi regions (Q645180) (← links)
- On the roots of edge cover polynomials of graphs (Q648996) (← links)
- Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix (Q668097) (← links)
- Majorization and the spectral radius of starlike trees (Q724741) (← links)
- Coxeter energy of graphs (Q739111) (← links)
- Graph functions maximized on a path (Q745175) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- On the spectral radius of graphs with connectivity at most \(k\) (Q839379) (← links)
- The Estrada index of chemical trees (Q848156) (← links)
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial (Q902842) (← links)
- Eigenvalues of neutral networks: interpolating between hypercubes (Q906473) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\) (Q944719) (← links)
- Computing the characteristic polynomial of a tree (Q1057861) (← links)
- Inverses of trees (Q1066161) (← links)
- Branching in graphs and molecules (Q1095945) (← links)
- On the maximal index of connected graphs (Q1174310) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- Ordering graphs with small index and its application (Q1613408) (← links)
- On the eigenvalues and spectral radius of starlike trees (Q1662424) (← links)
- Study of proteome maps using partial ordering (Q1722786) (← links)
- Spectral extremal results with forbidding linear forests (Q1733881) (← links)
- On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices (Q1735433) (← links)
- On the index of bicyclic graphs with perfect matchings (Q1827770) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree (Q1863520) (← links)
- Unicyclic graphs of minimal spectral radius (Q1940853) (← links)
- Ordering trees by the spectral radius of Laplacian (Q1977019) (← links)
- The matching polynomials and spectral radii of uniform supertrees (Q1991421) (← links)
- Partially ordering the class of invertible trees (Q2011139) (← links)
- Rank of Hadamard powers of Euclidean distance matrices (Q2014796) (← links)
- On a poset of trees revisited (Q2020047) (← links)
- Uniform supertrees with extremal spectral radii (Q2035146) (← links)
- On the spectral radius of block graphs having all their blocks of the same size (Q2052182) (← links)
- Characterizing attitudinal network graphs through frustration cloud (Q2066654) (← links)
- A relation between a vertex-degree-based topological index and its energy (Q2069866) (← links)
- Energy of a digraph with respect to a VDB topological index (Q2079788) (← links)
- On a conjecture about the spectral radius of block graphs (Q2109064) (← links)
- Fisher information and synchronisation transitions: a case-study of a finite size multi-network Kuramoto-Sakaguchi system (Q2116578) (← links)
- Novel results on partial Hosoya polynomials: an application in chemistry (Q2161874) (← links)
- Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) (Q2175476) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
