Abstract
Graph energy can be extended to digraphs via the trace norm. The trace norm of a digraph is the trace norm of its adjacency matrix, i.e. the sum of its singular values. In this work we find the oriented graphs that attain minimal and maximal trace norm over the set of oriented bicyclic graphs.
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.
