Sciweavers

Share
CPC
2002
113views more  CPC 2002»
9 years 6 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
JCT
2007
119views more  JCT 2007»
9 years 6 months ago
Cliques and the spectral radius
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...
Béla Bollobás, Vladimir Nikiforov
EJC
2010
9 years 7 months ago
Shilla distance-regular graphs
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...
Jack H. Koolen, Jongyook Park
GLOBECOM
2008
IEEE
9 years 7 months ago
Binary Consensus over Fading Channels: A Best Affine Estimation Approach
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...
Mehrzad Malmirchegini, Yongxiang Ruan, Yasamin Mos...
INFOCOM
2005
IEEE
10 years 17 days ago
Gossip algorithms: design, analysis and applications
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...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
books