AbstractLet A ∈ Mn be a nonsingular Hermitian matrix, let G be a chordal graph on vertices {1,…,n}, and suppose that G(A−1) ⊆ G. Then the inertia of A may be expressed in a simple way in terms of the inertias of those principal submatrices of A corresponding to certain readily identifiable sets of vertices of G. Specifically, we prove that the inertia i(A) satisfies the identity i(A)=∑α∈Ci(A[α])−∑β∈Sm(β)i(A[β]), in which C denotes the collection of maximal cliques of G, S denotes the collection of minimal vertex separators of G, and m(β) is the multiplicity of a separator β
AbstractFor i=1,2 let Hi be a given ni×ni Hermitian matrix. We characterize the set of inertias InH1...
A signed graph is a pair (G,Σ), where G = (V,E) is a graph (in which parallel edges are permitted, b...
The full set of completion inertias is described in terms of seven linear inequalities involving ine...
AbstractDefinition: A Hermitian matrix H is a Hermitian extension of a given set of Hermitian matric...
AbstractLet G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n×n...
AbstractWe demonstrate that subject to certain regularity conditions any invertible matrix whose inv...
AbstractThe inertia of a Hermitian matrix is defined to be a triplet composed of the numbers of the ...
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Denote by S(G) the set of all real symmetric n×n ma...
AbstractUsing elementary matrix algebra we establish the following theorems: (1.3) Let H be any n×n ...
AbstractLet n1,n2,n3 be nonnegative integers. We consider partitioned Hermitian matrices of the form...
Let G=(V,E) be a graph with V={1,2,…,n}. Denote by the set of all real symmetric n×n matrices A=[ai,...
We characterize sets of inertias of some partitioned Hermitian matrices by a system of inequalities ...
AbstractWe characterize the inertia of A+B for Hermitian matrices A and B when the rank of B is one....
AbstractWe characterize sets of inertias of some partitioned Hermitian matrices by a system of inequ...
AbstractLet n1, n2, n3 be nonnegative integers. We consider Hermitian matrices H of the form H=H11H1...
AbstractFor i=1,2 let Hi be a given ni×ni Hermitian matrix. We characterize the set of inertias InH1...
A signed graph is a pair (G,Σ), where G = (V,E) is a graph (in which parallel edges are permitted, b...
The full set of completion inertias is described in terms of seven linear inequalities involving ine...
AbstractDefinition: A Hermitian matrix H is a Hermitian extension of a given set of Hermitian matric...
AbstractLet G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n×n...
AbstractWe demonstrate that subject to certain regularity conditions any invertible matrix whose inv...
AbstractThe inertia of a Hermitian matrix is defined to be a triplet composed of the numbers of the ...
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Denote by S(G) the set of all real symmetric n×n ma...
AbstractUsing elementary matrix algebra we establish the following theorems: (1.3) Let H be any n×n ...
AbstractLet n1,n2,n3 be nonnegative integers. We consider partitioned Hermitian matrices of the form...
Let G=(V,E) be a graph with V={1,2,…,n}. Denote by the set of all real symmetric n×n matrices A=[ai,...
We characterize sets of inertias of some partitioned Hermitian matrices by a system of inequalities ...
AbstractWe characterize the inertia of A+B for Hermitian matrices A and B when the rank of B is one....
AbstractWe characterize sets of inertias of some partitioned Hermitian matrices by a system of inequ...
AbstractLet n1, n2, n3 be nonnegative integers. We consider Hermitian matrices H of the form H=H11H1...
AbstractFor i=1,2 let Hi be a given ni×ni Hermitian matrix. We characterize the set of inertias InH1...
A signed graph is a pair (G,Σ), where G = (V,E) is a graph (in which parallel edges are permitted, b...
The full set of completion inertias is described in terms of seven linear inequalities involving ine...