Complete signed graphs with largest maximum or smallest minimum eigenvalue

DOI10.1016/j.disc.2023.113860OpenAlexW4390493788MaRDI QIDQ6117351

Arezoo Majidi, Ebrahim Ghorbani

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113860

zbMATH Keywords

indexsigned graphminimum eigenvalueSeidel matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Spectra of graphs
• Lifts, discrepancy and nearly optimal spectral gap
• On a conjecture of V. Nikiforov
• Comparison of graphs by their number of spanning trees
• Signed graphs with maximal index
• Extremal spectral results related to spanning trees of signed complete graphs
• Cographs: eigenvalues and Dilworth number
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• On a simple characterisation of threshold graphs
• The structure of threshold graphs
• On graphs with randomly deleted edges
• The Dilworth Number of a Graph
• Connected signed graphs of fixed order, size, and number of negative edges with maximal index
• Open problems in the spectral theory of signed graphs

This page was built for publication: Complete signed graphs with largest maximum or smallest minimum eigenvalue