124 search results - page 1 / 25 » The spread of the unicyclic graphs |
EJC
2010
13 years 4 months ago
2010
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
DAM
2008
13 years 4 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
APPML
2006
13 years 4 months ago
2006
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
STACS
2012
Springer
12 years 5 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...