Naslov
Computing topological indices by pulling a few strings

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

Izvornik
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY (0340-6253) 67 (2012); 173-190

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA