IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v52y2021i2d10.1007_s13226-021-00061-4.html
   My bibliography  Save this article

On the number of connected subgraphs of graphs

Author

Listed:
  • Dinesh Pandey

    (National Institute of Science Education and Research (NISER)
    Homi Bhabha National Institute (HBNI))

  • Kamal Lochan Patra

    (National Institute of Science Education and Research (NISER)
    Homi Bhabha National Institute (HBNI))

Abstract

For a connected graph G, we denote the number of connected subgraphs of G by F(G). For a tree T, F(T) has been studied extensively and it has been observed that F(T) has a reverse correlation with Wiener index of T. We call F(G), the subgraph index of G. In this paper, we study the subgraph index of unicyclic graphs and graphs with fixed number of pendant vertices. We obtain the unicyclic graphs which extremize the subgraph index over all unicyclic graphs on n vertices. The graphs which extremize the subgraph index among all unicyclic graphs with fixed girth are also obtained. Among all connected graphs on n vertices with fixed number of pendant vertices, the graph which minimizes and the graph which maximizes the subgraph index are characterized.

Suggested Citation

  • Dinesh Pandey & Kamal Lochan Patra, 2021. "On the number of connected subgraphs of graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 52(2), pages 571-583, June.
    • Handle: RePEc:spr:indpam:v:52:y:2021:i:2:d:10.1007_s13226-021-00061-4
    DOI: 10.1007/s13226-021-00061-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-021-00061-4
    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/s13226-021-00061-4?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:indpam:v:52:y:2021:i:2:d:10.1007_s13226-021-00061-4. 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.