Sciweavers

208 search results - page 14 / 42
» The diameter of protean graphs
Sort
View
EJC
2006
13 years 7 months ago
Improving diameter bounds for distance-regular graphs
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
Sejeong Bang, Akira Hiraki, Jacobus H. Koolen
JCO
2007
76views more  JCO 2007»
13 years 7 months ago
Wide diameters of de Bruijn graphs
Abstract The wide diameter of a graph is an important parameter to measure faulttolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undir...
Jyhmin Kuo, Hung-Lin Fu
CPC
2010
117views more  CPC 2010»
13 years 4 months ago
Diameters in Supercritical Random Graphs Via First Passage Percolation
We study the diameter of C1, the largest component of the Erdos-R
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Per...
JCT
2007
85views more  JCT 2007»
13 years 7 months ago
Separating systems and oriented graphs of diameter two
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
Béla Bollobás, Alex D. Scott
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara