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

Upper bounds for the diameter and height of graphs of convex polyhedra

โœ Scribed by Gil Kalai

Book ID
105528813
Publisher
Springer
Year
1992
Tongue
English
Weight
619 KB
Volume
8
Category
Article
ISSN
0179-5376

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

An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
โœ David Barnette ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d