Sciweavers

CPC
2002
71views more  CPC 2002»
13 years 11 months ago
Lagrangians Of Hypergraphs
John M. Talbot
CPC
2002
113views more  CPC 2002»
13 years 11 months ago
Some Inequalities For The Largest Eigenvalue Of A Graph
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
Vladimir Nikiforov
CPC
2002
80views more  CPC 2002»
13 years 11 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
CPC
2002
75views more  CPC 2002»
13 years 11 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel
CPC
2002
98views more  CPC 2002»
13 years 11 months ago
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree
Brendan D. McKay, Ian M. Wanless, Nicholas C. Worm...
CPC
2002
48views more  CPC 2002»
13 years 11 months ago
A Sharp Threshold For Network Reliability
Michael Krivelevich, Benny Sudakov, Van H. Vu