vol20_pp351-353. 63KB Jun 04 2011 12:06:08 AM
Teks penuh
Dokumen terkait
We calculate here both exact and asymptotic formulas for the number of regions enclosed by the edges of a regular drawing of the complete bipartite graph K
The main result (Theorem II.1) of [1] states a necessary and sufficient condition for the existence of the Minkowski unit in the totally real cyclic fields of degree p n..
The second smallest eigenvalue (known as algebraic connectivity ) of the Laplacian matrix of an unicyclic graph is very much related to the 3rd smallest eigenvalue of a spanning tree
We conclude this section with the following result which gives an upper bound for the minimum entry of the principal eigenvector of a connected graph..
In [19], the Perron-Frobenius property stands for having the spectral radius as a positive eigenvalue with a nonnegative eigenvector; this is also the definition used in
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has
Using a bijection due to Bouttier, Di Francesco & Guitter between rooted bipartite planar maps and certain two-type trees with positive labels, we derive our results from
Laguerre ensemble, where the common distribution of the entries is complex Gaussian, one has an explicit correspondence between the largest eigenvalue of Y and the passage time to
