ON A POSET OF TREES

被引：26

作者：

Csikvari, Peter ^{[1
]}

机构：

[1] Eotvos Lorand Univ, Dept Algebra & Number Theory, H-1117 Budapest, Hungary

来源：

COMBINATORICA | 2010年 / 30卷 / 02期

关键词：

NETWORK RELIABILITY; ESTRADA INDEX; GRAPH; EDGES;

D O I：

10.1007/s00493-010-2516-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We will prove that the path minimizes the number of closed walks of length e 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.

引用

页码：125 / 137

页数：13

共 11 条

[1] NETWORK TRANSFORMATIONS AND BOUNDING NETWORK RELIABILITY [J].

BROWN, JI ;

COLBOURN, CJ ;

DEVITT, JS .

NETWORKS, 1993, 23 (01) :1-17

[2] ON THE SPECTRAL-RADIUS OF (0,1)-MATRICES [J].

BRUALDI, RA ;

HOFFMAN, AJ .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1985, 65 (FEB) :133-146

[3] Estimating the Estrada index [J].

de la Pena, Jose Antonio ;

Gutman, Ivan ;

Rada, Juan .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 427 (01) :70-76

[4]

Deng HY, 2009, MATCH-COMMUN MATH CO, V62, P599

[5] ON GRAPHS WITH RANDOMLY DELETED EDGES [J].

KELMANS, AK .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1981, 37 (1-3) :77-88

[6]

Lovasz L., 1973, Periodica Mathematica Hungarica, V3, P175, DOI DOI 10.1007/BF02018473

[7]

Lovasz L., 1993, COMBINATORIAL PROBLE

[8] Some inequalities for the largest eigenvalue of a graph [J].

Nikiforov, V .

COMBINATORICS PROBABILITY & COMPUTING, 2002, 11 (02) :179-189

[9] Bounds on graph eigenvalues II [J].

Nikiforov, Vladimir .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 427 (2-3) :183-189

[10] ON THE MAXIMAL INDEX OF GRAPHS WITH A PRESCRIBED NUMBER OF EDGES [J].

ROWLINSON, P .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1988, 110 :43-53

← 1 2 →