Abstract
The -th spectral moment of the adjacency matrix of a graph~ represents the number of closed walks of length~ in~. We study here the partial order of graphs, defined by if for all , and are interested in the question when is a linear order within a specified set of graphs? Our main result is that is a linear order on each set of starlike trees with constant number of vertices. Recall that a connected graph is a starlike tree if it has a vertex~ such that the components of are paths, called the branches of~. It turns out that the ordering of starlike trees with constant number of vertices coincides with the shortlex order of sorted sequence of their branch lengths.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.