crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 537374

Časopis

Autori: Došlić, Tomislav; Loghman, Amir; Badakshian, Leila
Naslov: Computing topological indices by pulling a few strings
( Computing topological indices by pulling a few strings )
Izvornik: MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY (0340-6253) 67 (2012); 173-190
Vrsta rada: članak
Ključne riječi: Eccentric connectivity index; Wiener index; Reverse Wiener index; Strings; Geometric-arithmetic index; Connectivity index
( Eccentric connectivity index; Wiener index; Reverse Wiener index; Strings; Geometric-arithmetic index; Connectivity index )
Sažetak:
A thread in a graph $G$ is any maximal connected subgraph induced by a set of vertices of degree $2$ in $G$. A string in $G$ is a subgraph induced by a thread and the vertices adjacent to it. A graph $G$ consists of $s$ strings if it can be represented as a union of $s$ strings so that any two strings have at most two vertices in common. In this paper we compute several recently introduced graph invariants for all graphs that consist of at most three strings.
Projekt / tema: 037-0000000-2779, 177-0000000-0884
Izvorni jezik: eng
Rad je indeksiran u
bazama podataka:
Scopus
SCI-EXP, SSCI i/ili A&HCI
Science Citation Index Expanded (SCI-EXP) (sastavni dio Web of Science Core Collectiona)
Kategorija: Znanstveni
Znanstvena područja:
Matematika
URL cjelovitog teksta:
Časopis izlazi u samo elektroničkom izdanju: NE
Google Scholar: Computing topological indices by pulling a few strings
Upisao u CROSBI: doslic@grad.hr (doslic@grad.hr), 11. Stu. 2011. u 12:30 sati



Verzija za printanje   za tiskati


upomoc
foot_4