The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A signed graph is a graph whose edges are labeled by signs. If has vertices, its spectral radius is the number , where are the eigenvalues of the signed adjacency matrix . Here we determine the signed graphs achieving the minimal or the maximal spectral radius in the classes and of unbalanced unicyclic graphs and unbalanced bicyclic graphs, respectively.
Download Results (CSV)