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

On Sombor index of trees with fixed domination number

Author

Listed:
  • Sun, Xiaoling
  • Du, Jianwei

Abstract

The Sombor index is a novel topological molecular descriptor introduced by Gutman in 2021. In this work, the maximum and minimum Sombor indices of trees with fixed domination number are presented. Furthermore, the corresponding extremal trees are identified.

Suggested Citation

  • Sun, Xiaoling & Du, Jianwei, 2022. "On Sombor index of trees with fixed domination number," Applied Mathematics and Computation, Elsevier, vol. 421(C).
    • Handle: RePEc:eee:apmaco:v:421:y:2022:i:c:s0096300322000327
    DOI: 10.1016/j.amc.2022.126946
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Zhang, Weilin & You, Lihua & Liu, Hechao & Huang, Yufei, 2021. "The expected values and variances for Sombor indices in a general random chain," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    2. Shuchao Li & Xian Meng, 2015. "Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 468-488, October.
    3. Cruz, Roberto & Gutman, Ivan & Rada, Juan, 2021. "Sombor index of chemical graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    4. Shuchao Li & Huihui Zhang, 2016. "Some extremal properties of the multiplicatively weighted Harary index of a graph," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 961-978, April.
    5. Borovićanin, Bojana & Furtula, Boris, 2016. "On extremal Zagreb indices of trees with given domination number," Applied Mathematics and Computation, Elsevier, vol. 279(C), pages 208-218.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ayu Ameliatul Shahilah Ahmad Jamri & Fateme Movahedi & Roslan Hasni & Rudrusamy Gobithaasan & Mohammad Hadi Akhbari, 2022. "Minimum Randić Index of Trees with Fixed Total Domination Number," Mathematics, MDPI, vol. 10(20), pages 1-13, October.

    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.
    1. Bermudo, Sergio & Nápoles, Juan E. & Rada, Juan, 2020. "Extremal trees for the Randić index with given domination number," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    2. Wang, Yiqiao & Zheng, Lina, 2020. "Computation on the difference of Zagreb indices of maximal planar graphs with diameter two," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    3. Das, Kinkar Chandra, 2024. "Open problems on Sombor index of unicyclic and bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 473(C).
    4. Wang, Shaohui & Wang, Chunxiang & Liu, Jia-Bao, 2018. "On extremal multiplicative Zagreb indices of trees with given domination number," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 338-350.
    5. Cruz, Roberto & Rada, Juan & Sigarreta, José M., 2021. "Sombor index of trees with at most three branch vertices," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    6. Ayu Ameliatul Shahilah Ahmad Jamri & Fateme Movahedi & Roslan Hasni & Rudrusamy Gobithaasan & Mohammad Hadi Akhbari, 2022. "Minimum Randić Index of Trees with Fixed Total Domination Number," Mathematics, MDPI, vol. 10(20), pages 1-13, October.
    7. Fang Gao & Xiaoxin Li & Kai Zhou & Jia-Bao Liu, 2018. "The Extremal Graphs of Some Topological Indices with Given Vertex k -Partiteness," Mathematics, MDPI, vol. 6(11), pages 1-11, November.
    8. Cui, Qing & Zhong, Lingping, 2017. "The general Randić index of trees with given number of pendent vertices," Applied Mathematics and Computation, Elsevier, vol. 302(C), pages 111-121.
    9. Raza, Zahid & Akhter, Shehnaz, 2023. "On maximum Zagreb connection indices for trees with fixed domination number," Chaos, Solitons & Fractals, Elsevier, vol. 169(C).
    10. Shuchao Li & Licheng Zhang & Minjie Zhang, 2019. "On the extremal cacti of given parameters with respect to the difference of zagreb indices," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 421-442, August.
    11. Lkhagva Buyantogtokh & Batmend Horoldagva & Kinkar Chandra Das, 2020. "On reduced second Zagreb index," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 776-791, April.
    12. Borovićanin, Bojana & Furtula, Boris, 2016. "On extremal Zagreb indices of trees with given domination number," Applied Mathematics and Computation, Elsevier, vol. 279(C), pages 208-218.
    13. Zhang, Weilin & You, Lihua & Liu, Hechao & Huang, Yufei, 2021. "The expected values and variances for Sombor indices in a general random chain," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    14. Kinkar Chandra Das & Yilun Shang, 2021. "Some Extremal Graphs with Respect to Sombor Index," Mathematics, MDPI, vol. 9(11), pages 1-15, May.
    15. Li, Shuchao & Wang, Zheng & Zhang, Minjie, 2022. "On the extremal Sombor index of trees with a given diameter," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    16. Das, Kinkar Chandra & Gutman, Ivan, 2022. "On Sombor index of trees," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    17. Rada, Juan & Rodríguez, José M. & Sigarreta, José M., 2024. "Sombor index and elliptic Sombor index of benzenoid systems," Applied Mathematics and Computation, Elsevier, vol. 475(C).
    18. Shaohui Wang & Chunxiang Wang & Lin Chen & Jia-Bao Liu & Zehui Shao, 2018. "Maximizing and Minimizing Multiplicative Zagreb Indices of Graphs Subject to Given Number of Cut Edges," Mathematics, MDPI, vol. 6(11), pages 1-10, October.
    19. Chen, Meng & Zhu, Yan, 2024. "Extremal unicyclic graphs of Sombor index," Applied Mathematics and Computation, Elsevier, vol. 463(C).
    20. Lan, Yongxin & Li, Tao & Wang, Hua & Xia, Chengyi, 2019. "A note on extremal trees with degree conditions," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 70-79.

    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:421:y:2022:i:c:s0096300322000327. 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: 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.