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

Fast algorithms for computing the characteristic polynomial of threshold and chain graphs

Author

Listed:
  • Anđelić, M.
  • Simić, S.K.
  • Živković, D.
  • Dolićanin, E.Ć.

Abstract

The characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. Finding efficient algorithms for computing characteristic polynomial of graphs is an active area of research and for some graph classes, like threshold graphs, there exist very fast algorithms which exploit combinatorial structure of the graphs. In this paper, we put forward some novel ideas based on divisor technique to obtain fast algorithms for computing the characteristic polynomial of threshold and chain graphs.

Suggested Citation

  • Anđelić, M. & Simić, S.K. & Živković, D. & Dolićanin, E.Ć., 2018. "Fast algorithms for computing the characteristic polynomial of threshold and chain graphs," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 329-337.
    • Handle: RePEc:eee:apmaco:v:332:y:2018:i:c:p:329-337
    DOI: 10.1016/j.amc.2018.03.024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318301899
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.03.024?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.

    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:332:y:2018:i:c:p:329-337. 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.