On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
Author
Abstract
Suggested Citation
DOI: 10.1016/j.amc.2018.01.039
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ghebleh, M. & Kanso, A. & Stevanović, D., 2016. "Open quipus with the same Wiener index as their quadratic line graph," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 130-136.
- Andova, Vesna & Orlić, Damir & Škrekovski, Riste, 2017. "Leapfrog fullerenes and Wiener index," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 281-288.
- Črepnjak, Matevž & Tratnik, Niko, 2017. "The Szeged index and the Wiener index of partial cubes with applications to chemical graphs," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 324-333.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Klavžar, Sandi & Azubha Jemilet, D. & Rajasingh, Indra & Manuel, Paul & Parthiban, N., 2018. "General Transmission Lemma and Wiener complexity of triangular grids," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 115-122.
- Dobrynin, Andrey A., 2019. "Infinite family of 2-connected transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 1-4.
- Ghorbani, Modjtaba & Vaziri, Zahra, 2024. "On the Szeged and Wiener complexities in graphs," Applied Mathematics and Computation, Elsevier, vol. 470(C).
- Dobrynin, Andrey A. & Sharafdini, Reza, 2020. "Stepwise transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 371(C).
- Sharon, Jane Olive & Rajalaxmi, T.M. & Klavžar, Sandi & Rajan, R. Sundara & Rajasingh, Indra, 2021. "Transmission in H-naphtalenic nanosheet," Applied Mathematics and Computation, Elsevier, vol. 406(C).
- Bezhaev, Anatoly Yu. & Dobrynin, Andrey A., 2021. "On quartic transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).
- Anatoly Yu. Bezhaev & Andrey A. Dobrynin, 2022. "On Transmission Irregular Cubic Graphs of an Arbitrary Order," Mathematics, MDPI, vol. 10(15), pages 1-15, August.
- Martin Knor & Riste Škrekovski, 2020. "Wiener Complexity versus the Eccentric Complexity," Mathematics, MDPI, vol. 9(1), pages 1-9, December.
- Al-Yakoob, Salem & Stevanović, Dragan, 2020. "On transmission irregular starlike trees," Applied Mathematics and Computation, Elsevier, vol. 380(C).
- Hamid Darabi & Yaser Alizadeh & Sandi Klavžar & Kinkar Chandra Das, 2021. "On the relation between Wiener index and eccentricity of a graph," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 817-829, May.
- Andrey A. Dobrynin & Andrei Yu Vesnin, 2019. "On the Wiener Complexity and the Wiener Index of Fullerene Graphs," Mathematics, MDPI, vol. 7(11), pages 1-17, November.
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.- Sharon, Jane Olive & Rajalaxmi, T.M. & Klavžar, Sandi & Rajan, R. Sundara & Rajasingh, Indra, 2021. "Transmission in H-naphtalenic nanosheet," Applied Mathematics and Computation, Elsevier, vol. 406(C).
- Andrey A. Dobrynin & Andrei Yu Vesnin, 2019. "On the Wiener Complexity and the Wiener Index of Fullerene Graphs," Mathematics, MDPI, vol. 7(11), pages 1-17, November.
- Simon Brezovnik & Niko Tratnik & Petra Žigert Pleteršek, 2021. "Weighted Wiener Indices of Molecular Graphs with Application to Alkenes and Alkadienes," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
- Hriňáková, Katarína & Knor, Martin & Škrekovski, Riste, 2019. "An inequality between variable wiener index and variable szeged index," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
- Ji, Shengjin & Liu, Mengmeng & Wu, Jianliang, 2018. "A lower bound of revised Szeged index of bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 480-487.
- Tratnik, Niko, 2018. "On the Steiner hyper-Wiener index of a graph," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 360-371.
- Klavžar, Sandi & Azubha Jemilet, D. & Rajasingh, Indra & Manuel, Paul & Parthiban, N., 2018. "General Transmission Lemma and Wiener complexity of triangular grids," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 115-122.
- Brezovnik, Simon & Tratnik, Niko & Žigert Pleteršek, Petra, 2020. "Resonance graphs of catacondensed even ring systems," Applied Mathematics and Computation, Elsevier, vol. 374(C).
More about this item
Keywords
Wiener index; Wiener complexity; Asymmetric graphs; Trees; Uni-cyclic graphs;All these keywords.
Statistics
Access and download statisticsCorrections
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:328:y:2018:i:c:p:113-118. 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.