On maximum Estrada indices of bipartite graphs with some given parameters

DOI10.1016/j.laa.2014.09.033zbMath1303.05115arXiv1404.5368OpenAlexW2963274207MaRDI QIDQ471942

Shujing Wang, Fei Huang, Xue Liang Li

Publication date: 17 November 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5368

zbMATH Keywords

connectivitymaximum matchingEstrada indexwalkvertex cut

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (5)

Spectral Radius of Graphs ⋮ On extremal bipartite graphs with a given connectivity ⋮ On maximum Estrada indices of \(k\)-trees ⋮ Further results on monotonic graph invariants and bipartiteness number ⋮ Degree resistance distance of trees with some given parameters

Cites Work

• The Estrada index of unicyclic graphs
• On maximum Estrada indices of graphs with given parameters
• On Estrada index of trees
• Tricyclic graph with maximal Estrada index
• The Estrada index of chemical trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On maximum Estrada indices of bipartite graphs with some given parameters