On a poset of trees

  title={On a poset of trees},
  author={P{\'e}ter Csikv{\'a}ri},
We will prove that the path minimizes the number of closed walks of length l among the connected graphs for all l. Indeed, we will prove that the number of closed walks of length l and many other properties such as the spectral radius, Estada index increase or decrease along a certain poset of trees. This poset is a leveled poset with path as the smallest element and star as the greatest element. 

From This Paper

Figures and tables from this paper.


Publications referenced by this paper.
Showing 1-10 of 15 references

On graphs with randomly deleted edges

A. K. Kelmans
Acta. Math. Acad. Sci. Hung • 1981
View 7 Excerpts
Highly Influenced

A proof of a conjecture on the Estrada index , MATCH Commun

Hanyuan Deng
Estimating the Estrada index , Linear Algebra and its Applications • 2007

Estimating the Estrada index, Linear Algebra and its Applications

J. A. de la Peña, I. Gutnam, J. Rada
View 2 Excerpts

Subgraph centrality in complex networks.

Physical review. E, Statistical, nonlinear, and soft matter physics • 2005
View 1 Excerpt

Some Inequalities For The Largest Eigenvalue Of A Graph

Combinatorics, Probability & Computing • 2002
View 1 Excerpt

Characterization of 3D molecular structure

Ernesto Estrada
Chemical Physics Letters 319, • 2000
View 1 Excerpt

On the maximal index of graphs with a prescribed number of edges, Linear Algebra and its Applications

Peter Rowlinson

Similar Papers

Loading similar papers…