๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On maximum Estrada indices of bipartite graphs with some given parameters

โœ Scribed by Huang, Fei; Li, Xueliang; Wang, Shujing


Book ID
126582457
Publisher
Elsevier Science
Year
2015
Tongue
English
Weight
382 KB
Volume
465
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Wiener indices of trees and monocyclic g
โœ Zhibin Du ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB

## Abstract The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener in

Sharp upper bounds for Zagreb indices of
โœ Shuchao Li; Minjie Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 255 KB

For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of products of the degrees of a pair of adjacent vertices. In this work, we study the Zagreb indices of bipartite graphs of order n with diame

On the spectral radius of bipartite grap
โœ Mingqing Zhai; Ruifang Liu; Jinlong Shu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 123 KB

Let GB(n, d) be the set of bipartite graphs with order n and diam- eter d. This paper characterizes the extremal graph with the maximal spectral radius in GB(n, d). Furthermore, the maximal spectral radius is a decreasing function on d. At last, bipartite graphs with the second largest spectral radi