𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Note: An Upper Bound for the Diameter of a Graph

✍ Scribed by Merris, Russell

Book ID
118199581
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
140 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

An upper bound for the minimum rank of a
An upper bound for the minimum rank of a graph
✍ Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 137 KB
An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe