Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions

DOI10.1016/j.aml.2011.10.032zbMath1241.05018OpenAlexW2038443386MaRDI QIDQ419087

Bo Cheng, Bo Lian Liu

Publication date: 18 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.aml.2011.10.032

zbMATH Keywords

treeinteger partitionspectral moment

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items (4)

On the spectral moment of graphs with given clique number ⋮ Ordering starlike trees by the totality of their spectral moments ⋮ Unnamed Item ⋮ On the spectral moment of quasi-bicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the spectral moments of unicyclic graphs with fixed diameter
• The spectral moments of trees with given maximum degree
• Lexicographical ordering by spectral moments of trees with a prescribed diameter
• A table of connected graphs on six vertices
• Spectra of unicyclic graphs
• Handbook of Applied Algorithms

This page was built for publication: Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions