Pregled bibliografske jedinice broj: 461105
Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number // Journal of mathematical chemistry, 47 (2010), 2; 842-855 doi:10.1007/s10910-009-9604-7 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 461105 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
Autori
Du, Zhibin ; Zhou, Bo ; Trinajstić, Nenad
Izvornik
Journal of mathematical chemistry (0259-9791) 47
(2010), 2;
842-855
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Randić connectivity index ; Sum-connectivity index ; Product-connectivity index ; Trees Unicyclic graphs ; Matching number
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Kemija
POVEZANOST RADA
Projekti:
098-1770495-2919 - Razvoj metoda za modeliranje svojstava bioaktivnih molekula i proteina (Lučić, Bono, MZOS ) ( CroRIS)
Ustanove:
Institut "Ruđer Bošković", Zagreb
Profili:
Nenad Trinajstić
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
