Sciweavers

2270 search results - page 3 / 454
» On the distribution of eigenvalues of graphs
Sort
View
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 2 months ago
Spectral analysis of virus spreading in random geometric networks
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
Victor M. Preciado, Ali Jadbabaie
ISPAN
2005
IEEE
14 years 3 months ago
The structure of super line graphs
For a given graph G = (V, E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S...
Jay Bagga, Daniela Ferrero
COMBINATORICS
2000
138views more  COMBINATORICS 2000»
13 years 9 months ago
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
Miguel Angel Fiol
INFOCOM
2007
IEEE
14 years 4 months ago
Towards Topology Aware Networks
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
Christos Gkantsidis, Gagan Goel, Milena Mihail, Am...
ORL
2008
115views more  ORL 2008»
13 years 9 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama