European Federation of Clinical Chemistry and Laboratory Medicine (EFLM) Working group for preanalytical phase (WG-PRE) has recently launched a series of conferences on preanalytical phase. First such meeting was held in Parma (Italy) in the spring of 2011 and the second one took place in Zagreb (Croatia) during 1-2 March 2013. The Zagreb audience had the opportunity to enjoy a focused and chal...

The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. It is well known that for connected or disconnected graphs with n vertices and m edges, the inequality M2/m ≥ M1/n does not always hold. Here we show that this relati...

Botica, Stipe. 2003. Andrija Ka i Miošši . Zagreb, Split: ŠŠkolska knjiga, Filozofski fakultet, Zbornik ““Ka i ””. ubeli , Tvrtko. 1970. Usmena narodna retorika i teatrologija. Zagreb: [s. n.]. Deli , Simona. 2001. Izme u klevete i kletve. Tema obitelji u hrvatskoj usmenoj baladi. Zageb: Hrvatska sveu iliššna naklada. Duki , Davor. 1998. Figura protivnika u hrvatskoj povijesnoj epici. Zagreb: H...

AIM To investigate urban-rural differences in the distribution of risk factors for breast cancer. METHODS We analyzed the data from the first round of the "Mamma" population based-screening program conducted in Croatia between 2007 and 2009 and self-reported questionnaire results for 924 patients with histologically verified breast cancer. Reproductive and anthropometric characteristics, fami...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

I was born in Zagreb (Croatia) on October 26, 1936. My parents were Regina (née Pavić) (April17, 1916, Zagreb–March 9, 1992, Zagreb) and Cvjetko Trinajstić (September 9, 1913, Volosko–October 29, 1998, Richmond, Australia).

For a graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Denote by Gn,k the set of graphs with n vertices and k cut edges. In this paper, we showed the types of graphs with the largest and the second largest M1 and M2 among Gn,k .