Open problems in the spectral theory of signed graphs

07/09/2019
by   Francesco Belardo, et al.
0

Signed graphs are graphs whose edges get a sign +1 or -1 (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much attention from graph spectra specialists. One motivation is that the spectral theory of signed graphs elegantly generalizes the spectral theories of unsigned graphs. On the other hand, unsigned graphs do not disappear completely, since their role can be taken by the special case of balanced signed graphs. Therefore, spectral problems defined and studied for unsigned graphs can be considered in terms of signed graphs, and sometimes such generalization shows nice properties which cannot be appreciated in terms of (unsigned) graphs. Here, we survey some general results on the adjacency spectra of signed graphs, and we consider some spectral problems which are inspired from the spectral theory of (unsigned) graphs.

READ FULL TEXT
research
08/10/2018

Construction of cospectral graphs

Construction of non-isomorphic cospectral graphs is a nontrivial problem...
research
07/01/2018

Comparing large-scale graphs based on quantum probability theory

In this paper, a new measurement to compare two large-scale graphs based...
research
08/29/2017

Drawing Big Graphs using Spectral Sparsification

Spectral sparsification is a general technique developed by Spielman et ...
research
03/04/2021

Weisfeiler–Leman, Graph Spectra, and Random Walks

The Weisfeiler–Leman algorithm is a ubiquitous tool for the Graph Isomor...
research
03/24/2020

A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering

Spectral sparsification is a technique that is used to reduce the number...
research
07/08/2019

Graph Signal Processing -- Part I: Graphs, Graph Spectra, and Spectral Clustering

The area of Data Analytics on graphs promises a paradigm shift as we app...
research
12/19/2019

A Maximum Entropy approach to Massive Graph Spectra

Graph spectral techniques for measuring graph similarity, or for learnin...

Please sign up or login with your details

Forgot password? Click here to reset