Ordering signed graphs with large index
DOI:
https://doi.org/10.26493/1855-3974.2714.9b3Keywords:
Adjacency matrix, largest eigenvalue, edge relocation, unbalanced signed graph, complete signed graphAbstract
The index of a signed graph is the largest eigenvalue of its adjacency matrix. We establish the first few signed graphs ordered decreasingly by the index in classes of connected signed graphs, connected unbalanced signed graphs and complete signed graphs with a fixed number of vertices.
Downloads
Published
2022-08-03
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/