Lower bounds for the Estrada index

Yilun Shang

doi:10.13001/1081-3810.1549

ScienceGate Book Chapters

JOURNAL ARTICLE

Lower bounds for the Estrada index

Yilun Shang

Year: 2012 Journal: Electronic Journal of Linear Algebra Vol: 23

DOI: 10.13001/1081-3810.1549

Get Full-Text PDF Get Analytical Report

Abstract

Let G be a graph with n vertices and λ 1 , λ 2 , . . ., λn be its eigenvalues.The Estrada index of G is defined as EE(G) = n i=1 e λ i .In this paper, new lower bounds for the Estrada index are established.

Keywords:

Mathematics Index (typography) Combinatorics Statistics

Metrics

Cited By

1.64

FWCI (Field Weighted Citation Impact)

Refs

0.84

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Lower bounds for the Estrada index

Abstract

Metrics

Citation History

Topics

Related Documents

Lower bounds for Estrada Index

Lower bounds for Estrada index and Laplacian Estrada index

Some Lower Bounds for Estrada Index

New Lower Bounds for Estrada Index

A note lower bounds for the Estrada index