2023
DOI: 10.1016/j.amc.2022.127736
|View full text |Cite
|
Sign up to set email alerts
|

Szeged and Mostar root-indices of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(15 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…Moreover, the concepts of a general Szeged‐like topological index and a general Szeged‐like polynomial were introduced in [7] and [20], respectively: if F is a regular function for a strength‐weighted connected graph Gsw, then the Szeged‐like topological index of Gsw is defined as TIF(Gsw)=eE(G)we(e)F(e|Gsw) and the Szeged‐like polynomial of Gsw is defined as SzPF(Gsw;x)=eE(G)we(e)xF(e|Gsw). As an example, some Szeged‐like topological indices are defined in Table 1, where we assume wv1, se1, and sv0.…”
Section: Multivariable Szeged‐like Polynomial Of Strength‐weighted Gr...mentioning
confidence: 99%
See 3 more Smart Citations
“…Moreover, the concepts of a general Szeged‐like topological index and a general Szeged‐like polynomial were introduced in [7] and [20], respectively: if F is a regular function for a strength‐weighted connected graph Gsw, then the Szeged‐like topological index of Gsw is defined as TIF(Gsw)=eE(G)we(e)F(e|Gsw) and the Szeged‐like polynomial of Gsw is defined as SzPF(Gsw;x)=eE(G)we(e)xF(e|Gsw). As an example, some Szeged‐like topological indices are defined in Table 1, where we assume wv1, se1, and sv0.…”
Section: Multivariable Szeged‐like Polynomial Of Strength‐weighted Gr...mentioning
confidence: 99%
“…In particular, we introduce the multivariable Szeged-like polynomial, which includes SMP polynomials, and derive the cut method for computing this general polynomial of several variables. Note that the cut method is often used for simple computation of various distance-based topological indices [7,20,22,23].…”
Section: Moðgþ ¼ Xmentioning
confidence: 99%
See 2 more Smart Citations
“…It is worth mentioning that graph polynomials provide much more information about a graph than corresponding topological indices, since a polynomial is defined by several numbers (coefficients) which are themselves topological descriptors. Note also that Szeged-like polynomials were very recently used to introduce so-called root-indices of graphs, which have better discrimination power than the corresponding standard topological indices [14].…”
Section: Introductionmentioning
confidence: 99%