Some Lower Bounds for Estrada Index

Bo Zhou; Zhibin Du

JOURNAL ARTICLE

Some Lower Bounds for Estrada Index

Year: 2010 Journal: Iranian journal of mathemathical chemistry./Iranian journal of mathemathical chemistry Vol: 1 (2)Pages: 67-72

Get Full-Text PDF Get Analytical Report

Abstract

For a graph G with n vertices, its Estrada index is defined as EE(G) = ∑ = n i i e 1 λ where n λ λ λ ,..., , 2 1 are the eigenvalues of . G A lot of properties especially lower and upper bounds for the Estrada index are known. We now establish further lower bounds for the Estrada index.

Keywords:

Mathematics Combinatorics Upper and lower bounds Index (typography) Eigenvalues and eigenvectors Graph Connectivity Mathematical analysis

Metrics

Cited By

1.68

FWCI (Field Weighted Citation Impact)

Refs

0.82

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Synthesis and Properties of Aromatic Compounds

Physical Sciences → Chemistry → Organic Chemistry

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Some Lower Bounds for Estrada Index

Abstract

Metrics

Citation History

Topics

Related Documents

Some New Lower Bounds for the Estrada Index

Lower bounds for Estrada Index

Lower bounds for Estrada index and Laplacian Estrada index

Lower bounds for the Estrada index

New Lower Bounds for Estrada Index