engleski

Minimal Spectrum-Sums of Bipartite Graphs with Exactly Two Vertex-Disjoint Cycles

The spectrum-sum of a graph is defined as the sum of the absolute values of its eigenvalues. The graphs with minimal spectrum-sums in the class of connected bipartite graphs with exactly two vertex-disjoint cycles, in the class of connected bipartite graphs with exactly two vertex-disjoint cycles whose lengths are congruent with 2 modulo 4, and in the class of connected bipartite graphs with exactly two vertex-disjoint cycles one of which has length congruent with 2 modulo 4, are determined, respectively.

graph spectrum; spectrum-sum; bipartite graphs; alternant structures

nije evidentirano