IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v342y2019icp26-34.html
   My bibliography  Save this article

Extremal values of energy over oriented bicyclic graphs

Author

Listed:
  • Monsalve, Juan
  • Rada, Juan
  • Shi, Yongtang

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.

Suggested Citation

  • Monsalve, Juan & Rada, Juan & Shi, Yongtang, 2019. "Extremal values of energy over oriented bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 342(C), pages 26-34.
    • Handle: RePEc:eee:apmaco:v:342:y:2019:i:c:p:26-34
    DOI: 10.1016/j.amc.2018.09.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318307902
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.09.018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xiaolin Chen & Huishu Lian, 2019. "Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs," Complexity, Hindawi, vol. 2019, pages 1-7, April.
    2. Shao, Yanling & Gao, Yubin, 2019. "The maximal geometric-arithmetic energy of trees with at most two branched vertices," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:342:y:2019:i:c:p:26-34. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.