On two conjectures concerning trees with maximal inverse sum indeg index

The inverse sum indeg ( ISI ) index of a graph G = ( V , E ) is defined as I S I ( G ) = ∑ v i v j ∈ E d i d j / ( d i + d j ) , where V = { v 0 , v 1 , … , v n - 1 } and E are, respectively, the vertex set and edge set of G , and d i is the degree of vertex v i . This topological index was shown to...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational & applied mathematics 2022-09, Vol.41 (6), Article 252
Hauptverfasser:	Lin, Wenshui, Fu, Peifang, Zhang, Guodong, Hu, Peng, Wang, Yikai
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Applications of Mathematics Applied physics Computational mathematics Computational Mathematics and Numerical Analysis Mathematical Applications in Computer Science Mathematical Applications in the Physical Sciences Mathematics Mathematics and Statistics Trees (mathematics) Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!