IDEAS home Printed from https://ideas.repec.org/a/wly/jjmath/v2025y2025i1n5566504.html

On the Multiplicative Sum Zagreb Index of Molecular Trees With Given Order and Number of Branching Vertices

Author

Listed:
  • Sadia Noureen
  • Mubashar Abbas
  • Abdulaziz Mutlaq Alotaibi
  • Jaya Percival Mazorodze
  • Taher S. Hassan
  • Akbar Ali

Abstract

The multiplicative sum Zagreb index of a graph G is defined as the product of the sum of the degrees of adjacent vertices of G. A molecular tree is an acyclic connected graph with maximum degree at most 4. A vertex in a molecular tree with degree 3 or 4 is referred to as a branching vertex. In this paper, we consider the class of all molecular trees of fixed order and with a given number of branching vertices and study the members of this class with the maximum value of the multiplicative sum Zagreb index.

Suggested Citation

  • Sadia Noureen & Mubashar Abbas & Abdulaziz Mutlaq Alotaibi & Jaya Percival Mazorodze & Taher S. Hassan & Akbar Ali, 2025. "On the Multiplicative Sum Zagreb Index of Molecular Trees With Given Order and Number of Branching Vertices," Journal of Mathematics, John Wiley & Sons, vol. 2025(1).
    • Handle: RePEc:wly:jjmath:v:2025:y:2025:i:1:n:5566504
    DOI: 10.1155/jom/5566504
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/jom/5566504
    Download Restriction: no
    File URL: https://libkey.io/10.1155/jom/5566504?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
    ---><---

    References listed on IDEAS

    as
    1. Akbar Ali & Sadia Noureen & Abdul Moeed & Naveed Iqbal & Taher S. Hassan, 2024. "Fixed-Order Chemical Trees with Given Segments and Their Maximum Multiplicative Sum Zagreb Index," Mathematics, MDPI, vol. 12(8), pages 1-19, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      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:wly:jjmath:v:2025:y:2025:i:1:n:5566504. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/1469 .

      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.