Lower bounds for Estrada Index

İvan Gutman

doi:10.2298/pim0897001g

ScienceGate Book Chapters

JOURNAL ARTICLE

Lower bounds for Estrada Index

İvan Gutman

Year: 2008 Journal: Publications de l Institut Mathematique Vol: 83 (97)Pages: 1-7

DOI: 10.2298/pim0897001g

Get Full-Text PDF Get Analytical Report

Abstract

If G is an (n,m)-graph whose spectrum consists of the numbers ?1, ?2, . . . , ?n, then its Estrada index is EE(G) = ?n i=1 e?i . We establish lower bounds for EE(G) in terms of n and m.

Keywords:

Mathematics Combinatorics Index (typography) Graph Spectrum (functional analysis) Upper and lower bounds Mathematical analysis Physics Computer science

Metrics

Cited By

3.54

FWCI (Field Weighted Citation Impact)

Refs

0.93

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Lower bounds for Estrada Index

Abstract

Metrics

Citation History

Topics

Related Documents

Lower bounds for Estrada index and Laplacian Estrada index

Some Lower Bounds for Estrada Index

Lower bounds for the Estrada index

New Lower Bounds for Estrada Index

A note lower bounds for the Estrada index