Among unicyclic digraphs and signed digraphs with fixed number of vertices, thedigraphs and signed digraphs with minimal and maximal energy are already determined. In thispaper we address the problem of finding bicyclic signed digraphs with extremal energy. Weobtain minimal and maximal energy among all those n-vertex bicyclic signed digraphs whichcontain vertex-disjoint signed directed cycles, n 4.
展开▼
