The Number of P-Vertices of Singular Acyclic Matrices: An Inverse Problem
Let A be a real symmetric matrix. If after we delete a row and a column of the same index, the nullity increases by one, we call that index a P-vertex of A. When A is an n × n singular acyclic matrix, it is known that the maximum number of P-vertices is n − 2. If T is the underlying tree of A, we wi...
Main Authors: | Du Zhibin, da Fonseca Carlos M. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2282 |
Similar Items
-
A trace bound for integer-diagonal positive semidefinite matrices
by: Mitchell Lon
Published: (2020-01-01) -
Cospectral constructions for several graph matrices using cousin vertices
by: Lorenzen Kate
Published: (2021-06-01) -
Characterization of α1 and α2-matrices
by: Bru Rafael, et al.
Published: (2010-02-01) -
Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
by: Adm Mohammad, et al.
Published: (2020-11-01) -
The maximum multiplicity and the two largest
multiplicities of eigenvalues in a Hermitian
matrix whose graph is a tree
by: Fernandes Rosário
Published: (2015-01-01)