𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non-bipartiteness of Graphs and the Upper Bounds of Dirichlet Forms

✍ Scribed by Yusuke Higuchi; Tomoyuki Shirai

Book ID
106504256
Publisher
Springer Netherlands
Year
2006
Tongue
English
Weight
197 KB
Volume
25
Category
Article
ISSN
0926-2601

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

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