𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Remark on the upper bound of the degree of information graphs

✍ Scribed by M. I. Kratko


Book ID
112450418
Publisher
SP MAIK Nauka/Interperiodica
Year
1978
Tongue
English
Weight
207 KB
Volume
18
Category
Article
ISSN
0037-4466

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. (

On distance two graphs of upper bound gr
✍ Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 190 KB