Ordering starlike trees by the totality of their spectral moments
From MaRDI portal
Publication:2140999
DOI10.1007/S11083-021-09566-3OpenAlexW3162431343MaRDI QIDQ2140999
Publication date: 23 May 2022
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.09885
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network Properties Revealed through Matrix Functions
- On graphs with randomly deleted edges
- Eigenspaces of graphs
- Walks and paths in trees
- The Estrada index of chemical trees
- Spectra of unicyclic graphs
- 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
- The spectral moments of trees with given maximum degree
- Lexicographical ordering by spectral moments of trees with a prescribed diameter
- On the spectral moment of quasi-trees
- A table of connected graphs on six vertices
- Compactness results in extremal graph theory
- Locating the eigenvalues of trees
- Three observations on nonnegative matrices
- Number of walks and degree powers in a graph
- The number of walks in a graph
- On a poset of trees
- Spectral moments of trees with given degree sequence
- Majorization and the spectral radius of starlike trees
- Spectral radius ordering of starlike trees
- Matrix inequalities for iterative systems
Cited In (3)
This page was built for publication: Ordering starlike trees by the totality of their spectral moments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140999)
