Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

The real symmetric matrices of odd order with a P-set of maximum size

Zhibin DuCarlos M. da Fonseca — 2016

Czechoslovak Mathematical Journal

Suppose that A is a real symmetric matrix of order n . Denote by m A ( 0 ) the nullity of A . For a nonempty subset α of { 1 , 2 , ... , n } , let A ( α ) be the principal submatrix of A obtained from A by deleting the rows and columns indexed by α . When m A ( α ) ( 0 ) = m A ( 0 ) + | α | , we call α a P-set of A . It is known that every P-set of A contains at most n / 2 elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As a first step...

Tridiagonal matrices and spectral properties of some graph classes

Milica AndelićZhibin DuCarlos M. da FonsecaSlobodan K. Simić — 2020

Czechoslovak Mathematical Journal

A graph is called a chain graph if it is bipartite and the neighbourhoods of the vertices in each colour class form a chain with respect to inclusion. In this paper we give an explicit formula for the characteristic polynomial of any chain graph and we show that it can be expressed using the determinant of a particular tridiagonal matrix. Then this fact is applied to show that in a certain interval a chain graph does not have any nonzero eigenvalue. A similar result is provided for threshold graphs....

Page 1

Download Results (CSV)