Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions
From MaRDI portal
(Redirected from Publication:419087)
Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
Recommendations
- Lexicographical ordering by spectral moments of trees with a given bipartition
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- Trees with given degree sequence in \(S\)-order
- Lexicographical ordering of trees, unicyclic graphs and bicyclic graphs with respect to spectral moments
- scientific article; zbMATH DE number 5847240
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- A table of connected graphs on six vertices
- Analytic combinatorics
- Handbook of Applied Algorithms
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- On the spectral moments of unicyclic graphs with fixed diameter
- Spectra of unicyclic graphs
- The spectral moments of trees with given maximum degree
Cited in
(7)- Lexicographical ordering by spectral moments of trees with a given bipartition
- On the spectral moment of graphs with given clique number
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- Ordering starlike trees by the totality of their spectral moments
- On the skew spectral moments of trees and unicyclic graphs
- 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)
