Digitalni repozitorij raziskovalnih organizacij Slovenije

Izpis gradiva
A+ | A- | Pomoč | SLO | ENG

Naslov:Generalized cut method for computing Szeged-like polynomials with applications to polyphenyls and carbon nanocones
Avtorji:ID Brezovnik, Simon (Avtor)
ID Tratnik, Niko (Avtor)
Datoteke:.pdf PDF - Predstavitvena datoteka, prenos (599,00 KB)
MD5: AEF82592E51F20F73DAEEFCA04BBD4F6
 
Jezik:Angleški jezik
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:Logo IMFM - Inštitut za matematiko, fiziko in mehaniko
Povzetek: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.
Ključne besede:graph theory, carbon nanocone, topological indices
Status publikacije:Objavljeno
Verzija publikacije:Objavljena publikacija
Datum objave:01.01.2023
Leto izida:2023
Št. strani:str. 401-427
Številčenje:Vol. 90, no. 2
PID:20.500.12556/DiRROS-18488 Novo okno
UDK:519.17
ISSN pri članku:0340-6253
DOI:10.46793/match.90-2.401B Novo okno
COBISS.SI-ID:150208771 Novo okno
Datum objave v DiRROS:20.03.2024
Število ogledov:659
Število prenosov:194
Metapodatki:XML DC-XML DC-RDF
:
BREZOVNIK, Simon in 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 [na spletu]. 2023. Vol. 90, no. 2, p. 401–427. [Dostopano 6 april 2025]. DOI 10.46793/match.90-2.401B. Pridobljeno s: https://dirros.openscience.si/IzpisGradiva.php?lang=slv&id=18488
Kopiraj citat
  
Objavi na:Bookmark and Share


Podobna dela iz repozitorija:

Ni podobnih del
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Match : communications in mathematical and in computer chemistry
Skrajšan naslov:Match
Založnik:University of Kragujevac, Faculty of Science
ISSN:0340-6253
COBISS.SI-ID:2624551 Novo okno

Gradivo je financirano iz projekta

Financer:ARRS - Agencija za raziskovalno dejavnost Republike Slovenije
Številka projekta:J1-4031
Naslov:Računalniška knjižnica za zavozlane strukture in aplikacije
Financer:ARRS - Agencija za raziskovalno dejavnost Republike Slovenije
Številka projekta:P1-0297
Naslov:Teorija grafov
Financer:ARRS - Agencija za raziskovalno dejavnost Republike Slovenije
Številka projekta:N1-0285
Naslov:Metrični problemi v grafih in hipergrafih

Nazaj