The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The spectral method for detrmining the number of trees.”

A note on distance spectral radius of trees

Yanna Wang, Rundan Xing, Bo Zhou, Fengming Dong (2017)

Special Matrices

Similarity:

The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.

The Direct and Inverse Spectral Problems for some Banded Matrices

Zagorodnyuk, S. M. (2011)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 15A29. In this paper we introduced a notion of the generalized spectral function for a matrix J = (gk,l)k,l = 0 Ґ, gk,l О C, such that gk,l = 0, if |k-l | > N; gk,k+N = 1, and gk,k-N № 0. Here N is a fixed positive integer. The direct and inverse spectral problems for such matrices are stated and solved. An integral representation for the generalized spectral function is obtained.