On a Poset of Trees II

DOI10.1002/jgt.21693zbMath1272.05109MaRDI QIDQ2852613

Péter Csikvári

Publication date: 9 October 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21693

zbMATH Keywords

eigenvalues; adjacency matrix; Laplacian matrix; independence polynomial; edge cover polynomial

Mathematics Subject Classification ID

05C31: Graph polynomials

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

Related Items

Inequalities among two rowed immanants of the q-Laplacian of trees and odd height peaks in generalized Dyck paths, Homomorphisms of Trees into a Path, A note on the distance and distance signless Laplacian spectral radius of complements of trees, Graph homomorphisms between trees, Sidorenko's conjecture, colorings and independent sets, On the roots of edge cover polynomials of graphs, Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees, On a poset of trees revisited, The 2-Steiner distance matrix of a tree, Eigenvalue monotonicity of \(q\)-Laplacians of trees along a poset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a poset of trees
• On the roots of edge cover polynomials of graphs
• On the Laplacian coefficients of acyclic graphs
• The algebraic connectivity of graphs under perturbation
• On the Laplacian coefficients of unicyclic graphs
• Bounds on the largest root of the matching polynomial
• Bounds on graph eigenvalues. II
• On the second largest Laplacian eigenvalue of trees
• Connections between Wiener index and matchings
• On the eigenvalues of trees
• Dependence polynomials
• Walks and paths in trees
• Some Inequalities for the Largest Eigenvalue of a Graph
• On the coefficients of the Laplacian characteristic polynomial of trees
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Characteristic vertices of trees^*
• Ordering trees by algebraic connectivity