IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i2d10.1007_s10878-019-00503-0.html
   My bibliography  Save this article

On alternating paths and the smallest positive eigenvalue of trees

Author

Listed:
  • Sonu Rani

    (Indian Institute of Technology, Bhubaneswar)

  • Sasmita Barik

    (Indian Institute of Technology, Bhubaneswar)

Abstract

In this article, we consider the class of tress on a fixed number of vertices. We consider the problem of finding trees with first four minimum smallest positive eigenvalues. First we obtain the upper and lower bounds on number of alternating paths in a tree. It is shown that the smallest positive eigenvalue of a tree is related to the number of alternating paths in it. With the help of combinatorial arguments, the trees with the maximum, second maximum and third maximum number of alternating paths are derived. Subsequently, the unique trees with the second minimum, third minimum and fourth minimum smallest positive eigenvalue are characterized.

Suggested Citation

  • Sonu Rani & Sasmita Barik, 2020. "On alternating paths and the smallest positive eigenvalue of trees," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 589-601, February.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-019-00503-0
    DOI: 10.1007/s10878-019-00503-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00503-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-019-00503-0?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:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-019-00503-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.