๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

GRAPHICAL CONFLICT I: A NEW CLASS OF EXTREMAL PROBLEMS

โœ Scribed by Frank Harary; Jerald A. Kabell


Book ID
118717663
Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
255 KB
Volume
319
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Minimizer graphs for a class of extremal
โœ Dan Ismailescu; Dan Stefanica ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 2 views

## Abstract We consider the family of graphs with a fixed number of vertices and edges. Among all these graphs, we are looking for those minimizing the sum of the square roots of the vertex degrees. We prove that there is a unique such graph, which consists of the largest possible complete subgraph