Let G be a connected graph with vertex set V (G). The degree resistance distance of G is defined as DR(G) = âˆ‘ fu,vg V (G)[d(u) +d(v)]R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotesâ€¦ (More)

In this paper, we study the signless Laplacian spectral radius of bicyclic graphs with given number of pendant vertices and characterize the extremal graphs.

In this paper, we first give a relation between the adjacency spectral radius and the Q-spectral radius of a graph. Then using this result, we further give some new sharp upper bounds on theâ€¦ (More)

In this paper, we study the signless Laplacian spectral radius of unicyclic graphs with prescribed number of pendant vertices or independence number. We also characterize the extremal graphsâ€¦ (More)

Journal of traditional Chinese medicine = Chung iâ€¦

2007

OBJECTIVE
To observe the therapeutic effects of different acupuncture methods for spastic hemiparalysis due to cerebrovascular disorders.
METHODS
90 cases of spastic hemiparalysis after wind-strokeâ€¦ (More)

is the diagonal matrix of vertex degrees of G and A(G) is the adjacency matrix of G. The eigenvalues of L(G) are called the Laplacian eigenvalues and denoted by Î»1 â‰¥ Î»2 â‰¥ Â· Â· Â· â‰¥ Î»n = 0. It is wellâ€¦ (More)

We consider the set Gn,k of graphs of order n with the chromatic number k â‰¥ 2. In this note, we prove that in Gn,k the TurÃ¡n graph Tn,k has the maximal spectral radius; and Pn if k = 2, Cn if k = 3â€¦ (More)