534 search results - page 18 / 107 » Diameter critical graphs |
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
DAM
2007
13 years 9 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
JCT
2006
13 years 9 months ago
2006
For z1, z2, z3 Zn, the tristance d3(z1, z2, z3) is a generalization of the L1-distance on Zn to a quantity that reflects the relative dispersion of three points rather than two. ...
EJC
2010
13 years 9 months ago
2010
A Shilla distance-regular graph (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divide...
WAW
2007
Springer
14 years 3 months ago
2007
Springer
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...