On the largest eigenvalue of signed unicyclic graphs

被引：22

作者：

Akbari, Saieed ^{[1
]}

Belardo, Francesco ^{[2
]}

Heydari, Farideh ^{[3
]}

Maghasedi, Mohammad ^{[3
]}

Souri, Mona ^{[3
]}

机构：

[1] Sharif Univ Technol, Dept Math Sci, Tehran, Iran

[2] Univ Naples Federico II, Dept Math & Applicat R Caccioppoli, Naples, Italy

[3] Islamic Azad Univ, Karaj Branch, Dept Math, Karaj, Iran

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2019年 / 581卷

基金：

美国国家科学基金会;

关键词：

Signed graph; Largest eigenvalue; Unbalanced graph; Unicyclic graphs; Index;

D O I：

10.1016/j.laa.2019.06.016

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 2019 Published by Elsevier Inc.

引用

页码：145 / 162

页数：18

共 18 条

[1] Spectral characterizations of signed cycles [J].