Sharp bounds on the signless Laplacian Estrada index of graphs

Shan Gao; Huiqing Liu

doi:10.2298/fil1410983g

ScienceGate Book Chapters

JOURNAL ARTICLE

Sharp bounds on the signless Laplacian Estrada index of graphs

Shan Gao Huiqing Liu

Year: 2014 Journal: Filomat Vol: 28 (10)Pages: 1983-1988 Publisher: University of Niš

DOI: 10.2298/fil1410983g

Get Full-Text PDF Get Analytical Report

Abstract

Let G be a connected graph with n vertices and m edges. Let q1, q2,..., qn be the eigenvalues of the signless Laplacian matrix of G, where q1 ? q2 ? ... ? qn. The signless Laplacian Estrada index of G is defined as SLEE(G) = nPi=1 eqi. In this paper, we present some sharp lower bounds for SLEE(G) in terms of the k-degree and the first Zagreb index, respectively.

Keywords:

Mathematics Combinatorics Graph Eigenvalues and eigenvectors Connectivity Laplacian matrix Index (typography) Physics Computer science

Metrics

Cited By

0.43

FWCI (Field Weighted Citation Impact)

Refs

0.67

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

Computational Drug Discovery Methods

Physical Sciences → Computer Science → Computational Theory and Mathematics

Sharp bounds on the signless Laplacian Estrada index of graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Graphs with maximum Laplacian and signless Laplacian Estrada index

Sharp lower bounds for the Laplacian Estrada index of graphs

The Signless Laplacian Estrada Index of Unicyclic Graphs

The signless Laplacian Estrada index of tricyclic graphs

Maximum signless Laplacian Estrada index of tetracyclic graphs