Ordering starlike trees by the totality of their spectral moments

DOI10.1007/s11083-021-09566-3OpenAlexW3162431343MaRDI QIDQ2140999

Dragan Stevanović

Publication date: 23 May 2022

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09885

zbMATH Keywords

spectral momentsstarlike treeslinear orderclosed walks

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Related Items (1)

On the relationship between shortlex order and \(A_\alpha \)-spectral radii of graphs with starlike branch tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectral moment of graphs with given clique number
• Lexicographical ordering by spectral moments of trees with \(k\) pendant vertices and integer partitions
• On the spectral moments of unicyclic graphs with fixed diameter
• On a poset of trees
• The spectral moments of trees with given maximum degree
• Lexicographical ordering by spectral moments of trees with a prescribed diameter
• Locating the eigenvalues of trees
• On the spectral moment of quasi-trees
• Majorization and the spectral radius of starlike trees
• A table of connected graphs on six vertices
• The Estrada index of chemical trees
• Number of walks and degree powers in a graph
• Spectra of unicyclic graphs
• The number of walks in a graph
• Compactness results in extremal graph theory
• Spectral moments of trees with given degree sequence
• Walks and paths in trees
• Network Properties Revealed through Matrix Functions
• On graphs with randomly deleted edges
• Spectral radius ordering of starlike trees
• Three observations on nonnegative matrices
• Iterative Methods without Inversion

This page was built for publication: Ordering starlike trees by the totality of their spectral moments