2023
DOI: 10.46793/match.90-2.401b
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones

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 edgeSzeged 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 po… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…However, the cut method is not deduced only for SMP polynomials, but can be applied also for the introduced multivariable Szeged‐like polynomial, which encompasses numerous graph polynomials. Therefore, the result of this paper significantly improves the main contributions of papers [7,20]. More precisely, in [7] the cut method was developed for any Szeged‐like topological index, which means that it can not be used for graph polynomials.…”
Section: Discussionmentioning
confidence: 82%
See 4 more Smart Citations
“…However, the cut method is not deduced only for SMP polynomials, but can be applied also for the introduced multivariable Szeged‐like polynomial, which encompasses numerous graph polynomials. Therefore, the result of this paper significantly improves the main contributions of papers [7,20]. More precisely, in [7] the cut method was developed for any Szeged‐like topological index, which means that it can not be used for graph polynomials.…”
Section: Discussionmentioning
confidence: 82%
“…In addition, if ={E1,,Er} is any partition of E(G), then we say that is coarser than 𝒰 if the set Ei is the union of one or more Θ‐classes of G for any i{1,,r}. In such a case, is a c‐partition of the set E(G) [7,20].…”
Section: Preliminariesmentioning
confidence: 99%
See 3 more Smart Citations