Learn More
Let G be a simple connected graph of order n with degree sequence d 1 , d 2 , · · · , d n in non-increasing order. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer at most n, we give a sharp upper bound for ρ(G) by a function of d 1 , d 2 , · · · , d , which generalizes a series of previous results.
Silicon nanowire possesses great potential as the material for renewable energy harvesting and conversion. The significantly reduced spectral reflectivity of silicon nanowire to visible light makes it even more attractive in solar energy applications. However, the benefit of its use for solar thermal energy harvesting remains to be investigated and has so(More)
Scalar and tensor glueball spectrum is studied using an improved gluonic action on asymmetric lattices in the pure SU (3) gauge theory. The smallest spatial lattice spacing is about 0.08f m which makes the extrapolation to the continuum limit more reliable. In particular, attention is paid to the scalar glueball mass which is known to have problems in the(More)
  • 1