Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Computing topological indices by pulling a few strings (CROSBI ID 176043)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Došlić, Tomislav ; Loghman, Amir ; Badakshian, Leila Computing topological indices by pulling a few strings // MATCH : communications in mathematical and in computer chemistry, 67 (2012), 173-190

Podaci o odgovornosti

Došlić, Tomislav ; Loghman, Amir ; Badakshian, Leila

engleski

Computing topological indices by pulling a few strings

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.

Eccentric connectivity index; Wiener index; Reverse Wiener index; Strings; Geometric-arithmetic index; Connectivity index

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

67

2012.

173-190

objavljeno

0340-6253

Povezanost rada

Matematika

Indeksiranost