On a poset of trees
From MaRDI portal
Publication:532127
DOI10.1007/s00493-010-2516-0zbMath1224.05093OpenAlexW2038015327MaRDI QIDQ532127
Publication date: 26 April 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-010-2516-0
Related Items (25)
Walks and paths in trees ⋮ Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees ⋮ Ordering starlike trees by the totality of their spectral moments ⋮ On extremal bipartite bicyclic graphs ⋮ Generalized matrix polynomials of tree Laplacians indexed by symmetric functions and the GTS poset ⋮ A Turán-type problem on distances in graphs ⋮ Inequalities among two rowed immanants of the q-Laplacian of trees and odd height peaks in generalized Dyck paths ⋮ Integral trees of arbitrarily large diameters ⋮ On the Kirchhoff index of the complement of a bipartite graph ⋮ Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset ⋮ On the \(p\)-Schatten energy of bipartite graphs ⋮ A note on the distance and distance signless Laplacian spectral radius of complements of trees ⋮ Kemeny's constant and Wiener index on trees ⋮ On extremal bipartite unicyclic graphs ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ On the roots of edge cover polynomials of graphs ⋮ Graph homomorphisms between trees ⋮ On the generalized Wiener polarity index of trees with a given diameter ⋮ On a poset of trees revisited ⋮ Steiner Wiener index of block graphs ⋮ Beyond graph energy: norms of graphs and matrices ⋮ Homomorphisms of Trees into a Path ⋮ The 2-Steiner distance matrix of a tree ⋮ On a Poset of Trees II ⋮ On majorization of closed walk vectors of trees with given degree sequences
Cites Work
- Unnamed Item
- Unnamed Item
- On the spectral radius of (0,1)-matrices
- On the maximal index of graphs with a prescribed number of edges
- Estimating the Estrada index
- Bounds on graph eigenvalues. II
- On the eigenvalues of trees
- Some Inequalities for the Largest Eigenvalue of a Graph
- On graphs with randomly deleted edges
- A reliability-improving graph transformation with applications to network reliability
- Network transformations and bounding network reliability
This page was built for publication: On a poset of trees
