A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques

Gian Paolo Clemente, Alessandra Cornaro

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

In this note, we use a procedure, proposed in [1], based on a majorization technique, which localizes real eigenvalues of a matrix of order n. Through this information, we compute a lower bound for the Kirchhoff index (see [3]) that takes advantage of additional eigenvalues bounds. An algorithm has been developed with MATLAB software to evaluate the above mentioned bound. Finally, numerical examples are provided showing how tighter results can be obtained.
Original languageEnglish
Pages (from-to)383-390
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume2013
DOIs
Publication statusPublished - 2013

Keywords

  • Graphs
  • Kirchhoff Index
  • Majorization order

Fingerprint

Dive into the research topics of 'A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques'. Together they form a unique fingerprint.

Cite this