On a poset of trees revisited

DOI10.1016/j.aam.2021.102164zbMath1462.05090OpenAlexW3125897355MaRDI QIDQ2020047

Yuantian Yu, Shuchao Li

Publication date: 23 April 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2021.102164

zbMATH Keywords

Wiener indexindependence polynomialadjacency polynomialclosed walkLaplacian polynomialedge cover polynomial

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Combinatorics of partially ordered sets (06A07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (1)

On bipartite graphs having minimum fourth adjacency coefficient

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a poset of trees
• On Estrada index of trees
• On the edge cover polynomial of a graph
• On a conjecture concerning spanning tree invariants and loop systems
• The Estrada index of chemical trees
• Ordering trees by the Laplacian coefficients
• On the eigenvalues of trees
• On a Poset of Trees II
• Walks and paths in trees
• Distance in graphs
• The first three smallest Estrada indices for trees
• The first three largest Estrada indices for trees

This page was built for publication: On a poset of trees revisited