𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New upper bounds for Estrada index of bipartite graphs

✍ Scribed by G.H. Fath-Tabar; A.R. Ashrafi

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
271 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sharp upper bounds for Zagreb indices of
Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
✍ 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

A new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 89 KB πŸ‘ 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ β‰₯ 2^_

New bounds on the barycenter heuristic f
New bounds on the barycenter heuristic for bipartite graph drawing
✍ Xiao Yu Li; Matthias F. Stallmann πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 105 KB

The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well known that the barycenter heuristic can give solutions as bad as ( √ n ) times the optimum, where n is the number of nodes in the graph. However, the example used in the proof has man

A new upper bound for total colourings o
A new upper bound for total colourings of graphs
✍ AbdΓ³n SΓ‘nchez-Arroyo πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 118 KB

We give a new upper bound on the total chromatic number of a graph. This bound improves the results known for some classes of graphs. The bound is stated as follows: ZT ~< Z~ + L l3 ~ J + 2, where Z is the chromatic number, Z~ is the edge chromatic number (chromatic index) and ZT is the total chroma

New upper bounds on the decomposability
New upper bounds on the decomposability of planar graphs
✍ Fedor V. Fomin; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 335 KB πŸ‘ 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant Ξ±. We give a proof of the best, so far, upper bound for the constant Ξ±. In particular, for th