prikaz prve stranice dokumenta Mostar index
  Download
PDF 1.18 MB
Scientific paper - Original scientific paper
Mostar index
Journal of mathematical chemistry, 56 (2018); 2995-3013. urn:nbn:hr:237:920529
Došlić, Tomislav; Martinjak, Ivica; Škrekovski, Riste; Tipurić Spužević, Sanja; Zubac, Ivana

Cite this document

Došlić, T., Martinjak, I., Škrekovski, R., Tipurić Spužević, S. & Zubac, I. (2018). Mostar index. Journal of mathematical chemistry, 56., 2995-3013. Retrieved from https://urn.nsk.hr/urn:nbn:hr:237:920529

Došlić, Tomislav, et al. "Mostar index." Journal of mathematical chemistry, vol. 56, 2018, pp. 2995-3013. https://urn.nsk.hr/urn:nbn:hr:237:920529

Došlić, Tomislav, Ivica Martinjak, Riste Škrekovski, Sanja Tipurić Spužević and Ivana Zubac. "Mostar index." Journal of mathematical chemistry 56 (2018): 2995-3013. https://urn.nsk.hr/urn:nbn:hr:237:920529

Došlić, T., et al. (2018) 'Mostar index', Journal of mathematical chemistry, 56, pp. 2995-3013. Available at: https://urn.nsk.hr/urn:nbn:hr:237:920529 (Accessed 03 October 2024)

Došlić T, Martinjak I, Škrekovski R, Tipurić Spužević S, Zubac I. Mostar index. Journal of mathematical chemistry [Internet]. 2018 [cited 2024 October 03];56:2995-3013. Available at: https://urn.nsk.hr/urn:nbn:hr:237:920529

T. Došlić, I. Martinjak, R. Škrekovski, S. Tipurić Spužević and I. Zubac, "Mostar index", Journal of mathematical chemistry, vol. 56, pp. 2995-3013, 2018. [Online]. Available at: https://urn.nsk.hr/urn:nbn:hr:237:920529. [Accessed: 03 October 2024]

Please login to the repository to save this object to your list.
Metadata
Title (english)Mostar index
AuthorTomislav Došlić
AuthorIvica Martinjak
AuthorRiste Škrekovski
AuthorSanja Tipurić Spužević
AuthorIvana Zubac
Author's institutionUniversity of Zagreb
Faculty of Civil Engineering
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract (english)
We propose and investigate a new bond-additive structural invariant as a measure of peripherality in graphs. We first determine its extremal values and characterize extremal trees and unicyclic graphs. Then we show how it can be efficiently computed for large classes of chemically interesting graphs using a variant of the cut method introduced by Klav\v{; ; ; z}; ; ; ar, Gutman and Mohar. Explicit formulas are presented for several classes of benzenoid graphs and Cartesian products. At the end we state several conjectures and list some open problems.
Keywords (english)
Languageenglish
Publication typeScientific paper - Original scientific paper
Publication statusPublished
Peer reviewPeer review - international
Publication versionPublished version
Journal titleJournal of mathematical chemistry
Numberingvol. 56, pp. 2995-3013
e-ISSN1572-8897
URN:NBNurn:nbn:hr:237:920529
Publication2018
Type of resourceText
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-09-05 09:19:44