In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...

The aim of this investigation was to determine the levels of heavy metals and metalloids in freshwater fish from the Zagreb area. A total of 216 freshwater fish samples from 5 sites were examined: Sava river upstream from Zagreb, Sava river at Zagreb, Sava river downstream from Zagreb, Jarun Lake, and 5 "ecologic" fishponds from the Zagreb surroundings. The metals lead, cadmium, mercury and the...

The aim of this paper is to determine the differences in the outpatient consumption of cardiovascular drugs between Croatian regions: the City of Zagreb and Lika-Senj County. The data on the number of packages and the purchase price for each drug have been obtained from all pharmacies in Lika-Senj County and all pharmacies in the City of Zagreb. Defined daily doses/1000 inhabitants/day (DDD/100...

Tatjana Vilibić-Čavlek1, Iva Pem-Novosel2, Ira Gjenero-Margan2, Nenad Pandak3, Ljiljana Perić4, Ljubo Barbić5, Karlo Kožul6, Eddy Listeš7, Pavle Jeličić8, Vladimir Stevanović5, Giovanni Savini9 1Department of Virology, Croatian National Institute of Public Health; School of Medicine University of Zagreb; 2Epidemiology Service, Croatian National Institute of Public Health, Zagreb; 3Department of...

For a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(G)/m, where M1(G) and M2(G) are the first and the second Zagreb indices of G, is known as Zagreb indices inequality. Generalization of these indices gives first M1(G) and second M2(G) variable Zagreb indices. Vukičević in [13] has given an incomplete proof for the claim: for all simple graphs and all λ ∈ [0, 12 ], hol...

We investigate the Zagreb index, one of the topological indices, of random recursive trees in this paper. Through a recurrence equation, the first two moments of Zn, the Zagreb index of a random recursive tree of size n, are obtained. We also show that the random process {Zn − E[Zn], n ≥ 1} is a martingale. Then the asymptotic normality of the Zagreb index of a random recursive tree is given by...

By adapting the notion of chirality group, the duality group of H can be defined as the the minimal subgroup D(H) E Mon(H) such that H/D(H) is a self-dual hypermap (a hypermap isomorphic to its dual). Here, we prove that for any positive integer d, we can find a hypermap of that duality index (the order of D(H)), even when some restrictions apply, and also that, for any positive integer k, we c...

This paper provides a unification-based implementation of Binding Theory (BT) for the English language in the framework of feature-based lexicalized tree-adjoining grammar (LTAG). The grammar presented here does not actually coindex any noun phrases, it merely outputs a set of constraints on coand contraindexation that may later be processed by a separate anaphora resolution module. It improves...

Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we define the ve...