Location of the eigenvalues of weighted graphs with a cut edge

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We establish some identities for the characteristic polynomial of Hermitian matrices whose graph is a cycle. We use the paper C.M da Fonesca: Interlacing properties for Hermitian matrices whose graph is a given tree, SIAM J. Matrix Anal. Appl. 27 (2005) pp. 130-141 and we extend some interlacing results obtained in this article to graphs with a cut edge. For some cases, we give a graphical interpretation of the results.

Original languageEnglish
Pages (from-to)305-322
Number of pages18
JournalLinear and Multilinear Algebra
Volume58
Issue number3
DOIs
Publication statusPublished - Apr 2010

Keywords

  • Cut edge
  • Cycle
  • Eigenvalues
  • Hermitian matrices
  • Interlacing

Fingerprint

Dive into the research topics of 'Location of the eigenvalues of weighted graphs with a cut edge'. Together they form a unique fingerprint.

Cite this