abs_vol20_pp168-179. 29KB Jun 04 2011 12:05:48 AM
Teks penuh
Dokumen terkait
Nevertheless, these results are strong enough to be able to determine the inertia set of each graph on 6 or fewer vertices and can be applied to many graphs with larger order as
We generalize the construction of canonical algebraic curvature tensors by self- adjoint endomorphisms of a vector space to arbitrary endomorphisms.. Provided certain basic
† Departamento de Matem´ aticas, Universidad Cat´ olica del Norte, Casilla 1280, Antofagasta, Chile..
Matrix functions, Generalization of nonnegative matrices, Eventually nonnegative matrices, Eventually positive matrices, Exponentially nonnegative matrices, Eventually exponen-
Combinatorial matrix theory, Inertia, Inverse eigenvalue problem, Inverse inertia problem, Graph, Minimum positive semidefinite rank, Minimum rank, Nil vertex, Symmetric.. AMS
In this section, we establish a lower bound on the condition number κj in terms of the length of the shortest cycle on at least two vertices in ∆( T )that goes through vertex j..
Weighted graph, Generalized Bethe tree, Laplacian matrix, Adjacency matrix, Spectral radius, Algebraic connectivity.. AMS
We prove Zhan’s conjecture, and a related inequality for positive semidefinite matrices, using standard facts about principal submatrices, Kronecker products, and the spectral
