56 research outputs found
On matrices which have signed null-spaces
AbstractWe denote by Q(A) the set of all matrices with the same sign pattern as A. A matrix A has signed null-space provided there exists a set S of sign patterns such that the set of sign patterns of vectors in the null-space of A is S, for each A∈Q(A). We show that if A is an m by n matrix with no duplicate columns up to multiplication by −1 and A has signed null-space, then n⩽3m−2. We also classify the set of matrices satisfying the equality
On Determining Minimal Spectrally Arbitrary Patterns
In this paper we present a new family of minimal spectrally arbitrary
patterns which allow for arbitrary spectrum by using the Nilpotent-Jacobian
method. The novel approach here is that we use the Intermediate Value Theorem
to avoid finding an explicit nilpotent realization of the new minimal
spectrally arbitrary patterns.Comment: 8 page
Tight Bounds on the Algebraic Connectivity of a Balanced Binary Tree
In this paper, quite tight lower and upper bounds are obtained on the algebraic connectivity, namely, the second-smallest eigenvalue of the Laplacian matrix, of an unweighted balanced binary tree with k levels and hence n = 2k - 1 vertices. This is accomplished by considering the inverse of a matrix of order k - 1 readily obtained from the Laplacian matrix. It is shown that the algebraic connectivity is 1/(2k - 2k + 3) + 0(1/22k)
Bounds on the subdominant eigenvalue involving group inverses with applications to graphs
summary:Let be an symmetric, irreducible, and nonnegative matrix whose eigenvalues are . In this paper we derive several lower and upper bounds, in particular on and , but also, indirectly, on . The bounds are in terms of the diagonal entries of the group generalized inverse, , of the singular and irreducible M-matrix . Our starting point is a spectral resolution for . We consider the case of equality in some of these inequalities and we apply our results to the algebraic connectivity of undirected graphs, where now becomes , the Laplacian of the graph. In case the graph is a tree we find a graph-theoretic interpretation for the entries of and we also sharpen an upper bound on the algebraic connectivity of a tree, which is due to Fiedler and which involves only the diagonal entries of , by exploiting the diagonal entries of
The Inverse Eigenvalue Problem of a Graph
Historically, matrix theory and combinatorics have enjoyed a powerful, mutually beneficial relationship. Examples include: Perron-Frobenius theory describes the relationship between the combinatorial arrangement of the entries of a nonnegative matrix and the properties of its eigenvalues and eigenvectors (see [53, Chapter 8]). The theory of vibrations (e.g., of a system of masses connected by strings) provides many inverse problems (e.g., can the stiffness of the springs be prescribed to achieve a system with a given set of fundamental vibrations?) whose resolution intimately depends upon the families of matrices with a common graph (see [46, Chapter 7]).
The Inverse Eigenvalue Problem of a graph (IEP-G), which is the focus of this chapter, is another such example of this relationship. The IEP-G is rooted in the 1960s work of Gantmacher, Krein, Parter and Fielder, but new concepts and techniques introduced in the last decade have advanced the subject significantly and catalyzed several mathematically rich lines of inquiry and application. We hope that this chapter will highlight these new ideas, while serving as a tutorial for those desiring to contribute to this expanding area
- …