| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

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:URL http://dx.doi.org/10.46793/match.90-2.401B
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
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 ▫$\Theta^*$▫-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
Year of publishing:2023
Number of pages:str. 401-427
Numbering:ǂVol. ǂ90, ǂno. ǂ2
PID:20.500.12556/DKUM-87692 New window
UDC:519.17
ISSN on article:0340-6253
COBISS.SI-ID:150208771 New window
DOI:10.46793/match.90-2.401B New window
Publication date in DKUM:25.03.2024
Views:387
Downloads:11
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
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

Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica