Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number (CROSBI ID 162300)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Du, Zhibin ; Zhou, Bo ; Trinajstić, Nenad
engleski
Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
The sum-connectivity index is a newly proposed molecular descriptor defined as the sum of the weights of the edges of the graph, where the weight of an edge uv of the graph, incident to vertices u and v, having degrees d u and d v is (d u + d v )−1/2. We obtain the minimum sum- connectivity indices of trees and unicyclic graphs with given number of vertices and matching number, respectively, and determine the corresponding extremal graphs. Additionally, we deduce the n-vertex unicyclic graphs with the first and second minimum sum- connectivity indices for n ≥ 4.
Randić connectivity index ; Sum-connectivity index ; Product-connectivity index ; Trees Unicyclic graphs ; Matching number
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
47 (2)
2010.
842-855
objavljeno
0259-9791
10.1007/s10910-009-9604-7