Processing math: 100%
Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Generalized cut method for computing Szeged-like polynomials with applications to polyphenyls and carbon nanocones
Authors:ID Brezovnik, Simon (Author)
ID Tratnik, Niko (Author)
Files:.pdf PDF - Presentation file, download (599,00 KB)
MD5: AEF82592E51F20F73DAEEFCA04BBD4F6
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Szeged, Padmakar-Ivan (PI), and Mostar indices are some of the most investigated distance-based Szeged-like topological indices. On the other hand, the polynomials related to these topological indices were also introduced, for example the Szeged polynomial, the edge- Szeged polynomial, the PI polynomial, the Mostar polynomial, etc. In this paper, we introduce a concept of the general Szeged-like polynomial for a connected strength-weighted graph. It turns out that this concept includes all the above mentioned polynomials and also infinitely many other graph polynomials. As the main result of the paper, we prove a cut method which enables us to efficiently calculate a Szeged-like polynomial by using the corresponding polynomials of strength-weighted quotient graphs obtained by a partition of the edge set that is coarser than Θ∗-partition. To the best of our knowledge, this represents the first implementation of the famous cut method to graph polynomials. Finally, we show how the deduced cut method can be applied to calculate some Szeged-like polynomials and corresponding topological indices of para-polyphenyl chains and carbon nanocones.
Keywords:graph theory, carbon nanocone, topological indices
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2023
Year of publishing:2023
Number of pages:str. 401-427
Numbering:Vol. 90, no. 2
PID:20.500.12556/DiRROS-18488 New window
UDC:519.17
ISSN on article:0340-6253
DOI:10.46793/match.90-2.401B New window
COBISS.SI-ID:150208771 New window
Publication date in DiRROS:20.03.2024
Views:663
Downloads:196
Metadata:XML DC-XML DC-RDF
:
BREZOVNIK, Simon and TRATNIK, Niko, 2023, Generalized cut method for computing Szeged-like polynomials with applications to polyphenyls and carbon nanocones. Match : communications in mathematical and in computer chemistry [online]. 2023. Vol. 90, no. 2, p. 401–427. [Accessed 10 April 2025]. DOI 10.46793/match.90-2.401B. Retrieved from: https://dirros.openscience.si/IzpisGradiva.php?lang=eng&id=18488
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Match : communications in mathematical and in computer chemistry
Shortened title:Match
Publisher:University of Kragujevac, Faculty of Science
ISSN:0340-6253
COBISS.SI-ID:2624551 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:J1-4031
Name:Računalniška knjižnica za zavozlane strukture in aplikacije
Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov
Funder:ARRS - Slovenian Research Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Back