28 search results - page 2 / 6 » Unicyclic graphs with exactly two main eigenvalues |
EJC
2006
13 years 4 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
CDC
2010
IEEE
12 years 12 months ago
2010
IEEE
In this paper we consider the problem of inducing a transition in a controlled quantum mechanical system whose spectrum loses simplicity for some values of the control. We study th...
CORR
2012
Springer
12 years 18 days ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
GC
2008
Springer
13 years 5 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...