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

DOI10.1016/J.AML.2011.10.032zbMATH Open1241.05018OpenAlexW2038443386MaRDI QIDQ419087FDOQ419087

Bo Cheng, Bolian 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

treespectral momentinteger partition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of unicyclic graphs
• 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
• Handbook of Applied Algorithms

Cited In (5)

• Title not available (Why is that?)
• On the spectral moment of graphs with given clique number
• Ordering starlike trees by the totality of their spectral moments
• On the spectral moment of quasi-bicyclic graphs
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419087)