Lexicographical ordering by spectral moments of trees with a prescribed diameter

DOI10.1016/J.LAA.2010.06.022zbMATH Open1208.05081OpenAlexW2059535321MaRDI QIDQ603099

Yaping Wu, Huiqing Liu

Publication date: 5 November 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.022

zbMATH Keywords

treediameterspectral moment

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent results in the theory of graph spectra
• Spectra of unicyclic graphs
• A table of connected graphs on six vertices

Cited In (12)

• Title not available (Why is that?)
• 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
• On the spectral moment of quasi-trees
• Ordering starlike trees by the totality of their spectral moments
• Spectral moments of hypertrees and their applications
• Estrada and L-Estrada Indices of a Graph and Their Relationship with the Number of Spanning Trees
• Title not available (Why is that?)
• SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
• Maximal lexicographic spectra and ranks for states with fixed uniform margins

This page was built for publication: Lexicographical ordering by spectral moments of trees with a prescribed diameter

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