On maximum Estrada indices of bipartite graphs with some given parameters

2014/04/22 by Fei Huang, Xueliang Li, Huang, Fei +3
Chemistry · Mathematics · Physics and Astronomy · #05C35 #05C50 #05C90 #15A18 #92E10 #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Graph theory and applications #Synthesis and Properties of Aromatic Compounds #math.CO #msc:05C35 #msc:05C50 #msc:05C90 #msc:15A18 #msc:92E10

paper · pdf · doi:10.48550/arxiv.1404.5368

14 pages, 3 figures

arxiv created 2014/04/22 · openalex publication_date 2014/04/22 · arxiv updated 2014/04/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Estrada index of a graph G is defined as EE(G)=∑_i=1ⁿe^λ_i, where λ₁, λ₂,…, λ_n are the eigenvalues of the adjacency matrix of G. In this paper, we characterize the unique bipartite graph with maximum Estrada index among bipartite graphs with given matching number and given vertex-connectivity, edge-connectivity, respectively.

Related

• Some New Lower Bounds for the Estrada Index
• On the Estrada index of unicyclic and bicyclic signed graphs
• An increasing sequence of lower bounds for the Estrada index of graphs\n and matrices
• New lower bounds for the Estrada and Signless Laplacian Estrada Index of\n a Graph
• On Maximum Signless Laplacian Estrada Index of Graphs with Given Parameters II