Photo by mbrunacr from unsplash
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the… Click to show full abstract
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cycles, n > 4 .
Keywords:
signed digraphs;
energy bicyclic;
bicyclic signed;
energy
Journal Title: Journal of Mathematical Inequalities
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Mathematical Inequalities
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!