In this paper, we introduced new index from the Zagreb family, named as -index is defined sum of degree five all vertices a graph. We derive some different graph operations such that Join, Cartesian product, Composition, Corona Tensor Product, Strong Disjunction, Symmetric difference, join Subdivision vertex are obtained.

The augmented Zagreb index (AZI) has attracted more and attentions in the past years. Some significant mathematical properties of AZI were obtained. In particular, Lin et al. [MATCH Commun. Math. Comput. Chem. 83 (2020) 167] recently claimed a complete solution to problem characterizing n-vertex tree(s) with maximal AZI. this note we correct some errors paper.

A NEAR-HANGING PATIENT WITH PTSD AND ACUTE STROKE AN UNUSUAL CONDITION FOR “OFF LABEL” THROMBOLYSIS Svjetlana Šupe, Zdravka Poljaković, Mario Habek, Goran Pavliša & Stanislava Stojanović-Špehar Department of Neurology, Intensive Care Unit, University Hospital Center Zagreb, Zagreb, Croatia Department of Diagnostic and Interventional Radiology, University Hospital Center Zagreb, Zagreb, Croatia ...

Mile Šikić, Alen Lančić, Nino Antulov-Fantulin, and Hrvoje Štefančić a Bioinformatics Institute, A*STAR, 30 Biopolis Street, #07-01 Matrix, 138671 Singapore Faculty of Science, Department of Mathematics, University of Zagreb, Zagreb, Croatia c Division of Electronics, Rudjer Bošković Institute, P.O.B. 180, HR-10002 Zagreb, Croatia d Theoretical Physics Division, Rudjer Bošković Institute, P.O.B...

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...