Abstract
The set of singular values of a digraph with respect to a vertex-degree based topological index is the set of all singular values of its general adjacency matrix. The spectral norm is the largest singular value and the energy the sum of the singular values. In this paper we characterize the digraphs which have exactly one singular value different from zero and the digraphs for which all singular values are equal. As a consequence, we deduce sharp upper and lower bounds for the spectral norm and energy of digraphs. In addition to being a natural generalization, proving the results in the general setting of digraphs allows us to deduce new results on graph energy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
