On the largest eigenvalue of signed unicyclic graphs

Akbari, S ; Sharif University of Technology | 2019

67 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.laa.2019.06.016
  3. Publisher: Elsevier Inc , 2019
  4. Abstract:
  5. Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied by means of graph matrices. Here we focus our attention to the largest eigenvalue, also known as the index of the adjacency matrix of signed graphs. Firstly we give some general results on the index variation when the corresponding signed graph is perturbed. Also, we determine signed graphs achieving the minimal or the maximal index in the class of unbalanced unicyclic graphs of order n≥3. © 2019
  6. Keywords:
  7. Largest eigenvalue ; Signed graph ; Unicyclic graphs ; Graphic methods ; Index ; Largest eigenvalues ; Signed graphs ; Unbalanced graph ; Unicyclic graph ; Eigenvalues and eigenfunctions
  8. Source: Linear Algebra and Its Applications ; Volume 581 , 2019 , Pages 145-162 ; 00243795 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S002437951930268X