𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New upper bounds on Zagreb indices

✍ Scribed by Kinkar Ch. Das; Ivan Gutman; Bo Zhou

Publisher
Springer
Year
2008
Tongue
English
Weight
140 KB
Volume
46
Category
Article
ISSN
0259-9791

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 harmonious colorings
New upper bounds on harmonious colorings
✍ Keith Edwards; Colin McDiarmid πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 435 KB

## Abstract We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider β€žfragmentable”︁ classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomposed into bounded‐sized components by removing