2000 character limit reached
On energy ordering of vertex-disjoint bicyclic sidigraphs
Published 8 Apr 2020 in math.CO | (2004.04032v1)
Abstract: The energy and iota energy of signed digraphs are respectively defined as the sum of absolute values of real parts and sum of absolute values of imaginary parts of its eigenvalues. Recently, Yang and Wang (2018) find the energy and iota energy ordering of digraphs in D(n) and compute the maximal energy and iota energy, where D(n) denotes the set of vertex-disjoint bicyclic digraphs of a fixed order n. In this paper, we investigate the energy ordering of signed digraphs in D(n,s) and finds the maximal energy, where D(n,s) denotes the set of vertex-disjoint bicyclic sidigraphs of a fixed order n.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.