English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

For a graph  G  we consider the problem of the existence of a switching equivalent signed graph with Laplacian eigenvalues that are all main and the problem of determination of all switching equivalent signed graphs with this spectral property. Using a computer search we confirm that apart from every connected graph with at most 7 vertices switches to at least one signed graph with the required property. This fails to hold for exactly 22 connected graphs with 8 vertices. If  G  is a cograph without repeated eigenvalues, then we give an iterative solution for the latter problem and the complete solution in the particular case when  G  is a threshold graph. The first problem is resolved positively for a particular class of chain graphs. The obtained results are applicable in control theory for generating controllable signed graphs based on Laplacian dynamics.

Signed graphs whose all Laplacian eigenvalues are main