Maximizing the largest eigenvalues of signed unicyclic graphs-Reference-Cited by-同舟云学术

Maximizing the largest eigenvalues of signed unicyclic graphs

Published:2020-01-21 Issue:02 Volume:12 Page:2050016
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Souri M.¹,Heydari F.¹,Maghasedi M.¹

Affiliation:

1. Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran

Abstract

Let [Formula: see text] be the set of all unbalanced unicyclic graphs of order [Formula: see text] and girth at least [Formula: see text]. In this paper, we determine the signed graph whose largest eigenvalue is maximal among all graphs in [Formula: see text].

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830920500160

Reference12 articles.

1. Spectral characterizations of signed cycles

2. On the largest eigenvalue of signed unicyclic graphs

3. On the eigenvalues of signed complete graphs

4. Combinatorial approach for computing the characteristic polynomial of a matrix

5. Some results on the index of unicyclic graphs

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximizing the Index of Signed Complete Graphs Containing a Spanning Tree with k Pendant Vertices;Axioms;2024-08-20

2. A characterization of $$(K_n,U^-)$$ in the class L(3);Ricerche di Matematica;2024-01-11

3. Some results on the complete sigraphs with exactly three non-negative eigenvalues;COMMUN COMB OPTIM;2024

4. Ordering signed graphs with large index;Ars Mathematica Contemporanea;2022-08-03

5. Unbalanced signed graphs with extremal spectral radius or index;Computational and Applied Mathematics;2022-03-24