Pregled bibliografske jedinice broj: 547737
On the sum-connectivity index
On the sum-connectivity index // Filomat, 25 (2011), 3; 29-42 doi:10.2298/FIL1103029W (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 547737 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On the sum-connectivity index
Autori
Wang, Shilin ; Zhou, Bo ; Trinajstić, Nenad
Izvornik
Filomat (0354-5180) 25
(2011), 3;
29-42
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Sum-connectivity index ; Product-connectivity index ; Randie connectivity index ; Triangle-free graph ; Minimum degree
Sažetak
The sum-connectivity index of a simple graph G is defined in mathematical chemistry as R(+) (G) = Sigma(uv is an element of E(G)) (d(u) + d(v))(-1/2), where E(G) is the edge set of G and d(u) is the degree of vertex u in G. We give a best possible lower bound for the sum-connectivity index of a graph (a triangle-free graph, respectively) with n vertices and minimum degree at least two and characterize the extremal graphs, where n >= 11.
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:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
