𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A relationship between bounds on the sum of squares of degrees of a graph

✍ Scribed by Yeon Soo Yoon; Ju Kyung Kim


Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
188 KB
Volume
21
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An upper bound on the sum of squares of
✍ D. de Caen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 163 KB

Let G be a simple graph with n vertices, e edges and vertex degrees &, d2 ..... d~. It is proved that d2+ ... +d~<~e(2e/(n-1)+ n-2) when n~>2. This bound does not generalize to all sequences of positive integers. A comparison is made to another upper bound on d 2 +. β€’ -+ d 2, due to Sz6kely et al. (

Tight bounds on the chromatic sum of a c
✍ Carsten Thomassen; Paul ErdΓΆs; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 236 KB πŸ‘ 1 views
A sharp lower bound for the circumferenc
✍ Vu Dinh Hoa πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

## Abstract We show that every 1‐tough graph __G__ on __n__ β‰₯ 3 vertices with Οƒ~3~≧ __n__ has a cycle of length at least min{__n, n__ + (Οƒ~3~/3 ) βˆ’ Ξ± + 1}, where Οƒ~3~ denotes the minimum value of the degree sum of any 3 pairwise nonadjacent vertices and Ξ± the cardinality of a miximum independent se

Bounds on the -spread of a graph
✍ Carla Silva Oliveira; Leonardo Silva de Lima; Nair Maria Maia de Abreu; Steve Ki πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 201 KB