Tetracyclic graphs with maximal Estrada index

Nader Jafari Rad; Akbar Jahanbani; Doost Ali Mojdeh

doi:10.1142/s1793830917500410

ScienceGate Book Chapters

JOURNAL ARTICLE

Tetracyclic graphs with maximal Estrada index

Nader Jafari Rad Akbar Jahanbani Doost Ali Mojdeh

Year: 2017 Journal: Discrete Mathematics Algorithms and Applications Vol: 09 (03)Pages: 1750041-1750041 Publisher: World Scientific

DOI: 10.1142/s1793830917500410

Get Full-Text PDF Get Analytical Report

Abstract

The Estrada index of a simple connected graph [Formula: see text] of order [Formula: see text] is defined as [Formula: see text], where [Formula: see text] are the eigenvalues of the adjacency matrix of [Formula: see text]. In this paper, we characterize all tetracyclic graphs of order [Formula: see text] with maximal Estrada index.

Keywords:

Mathematics Adjacency matrix Combinatorics Eigenvalues and eigenvectors Graph Index (typography) Order (exchange) Simple (philosophy) Adjacency list Discrete mathematics Computer science Physics

Metrics

Cited By

1.86

FWCI (Field Weighted Citation Impact)

Refs

0.83

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

Complex Network Analysis Techniques

Physical Sciences → Physics and Astronomy → Statistical and Nonlinear Physics

Tetracyclic graphs with maximal Estrada index

Abstract

Metrics

Citation History

Topics

Related Documents

Characterizing graphs with maximal Laplacian Estrada index

Maximum signless Laplacian Estrada index of tetracyclic graphs

Maximal Estrada index of unicyclic graphs with perfect matching

Graphs with the maximal Estrada indices

Tricyclic graph with maximal Estrada index