Ordering signed graphs with large index

Authors

DOI:

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

Keywords:

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

Abstract

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.

Published

2022-08-03

Issue

Section

Articles