Signed graphs with maximal index

2021/01/05 by Ghorbani, Ebrahim, Majidi, Arezoo · 2 citations
#05C22 #05C50 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2101.01503

Abstract

The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers n and m≤ n²/4, we determine the maximal index of complete signed graphs with n vertices and m negative edges. This settles (the corrected version of) a conjecture by Koledin and Stanić (2017).

Cited by

• The index of tC₃^--free signed graphs
• Spectral Turán problem for K_3,3^--free signed graphs

Related

• On the Signed Complete Graphs with Maximum Index
• The maximum index of signed complete graphs whose negative edges induce a bicyclic graph
• On the index of unbalanced signed bicyclic graphs
• Maximizing the index of signed complete graphs with spanning trees on k pendant vertices
• The largest eigenvalue of C₄^--free signed graphs