Ordering signed graphs with large index

Maurizio Brunetti, Zoran Stanić


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.


Adjacency matrix, largest eigenvalue, edge relocation, unbalanced signed graph, complete signed graph

Full Text:


DOI: https://doi.org/10.26493/1855-3974.2714.9b3

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications