A lower bound is given for the harmonic mean of the growth in a finite undirected graph 1 in terms of the eigenvalues of the Laplacian of 1. For a connected graph, this bound is tight if and only if the graph is distance-regular. Bounds on the diameter of a ``sphere-regular'' graph follow. Finally,
On the power of BFS to determine a graph's diameter
✍ Scribed by Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 199 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Let __G__ be a graph on __p__ vertices. Then for a positive integer __n__, __G__ is said to be __n__‐extendible if (i) __n__ < __p__/2, (ii) __G__ has a set of __n__ independent edges, and (iii) every such set is contained in a perfect matching of __G__. The purpose of this article is t
In a recent paper, BANIK. K ~H N E , and BAUER (1996) investigated the use of Fisher's combination test for two stage sampling in terms of its power as compared to the optimal test in the pooled sample. The distributional assumptions corresponded to the application of paired comparisons and parallel