CPC
2002
13 years 4 months ago
2002
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 ...
JCT
2007
13 years 4 months ago
2007
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
EJC
2010
13 years 4 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...
GLOBECOM
2008
IEEE
13 years 4 months ago
2008
IEEE
In this paper we consider a cooperative network that is trying to reach binary consensus over fading channels. We first characterize the impact of fading on network consensus by up...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...