Abstract In this paper, we give various lower and upper bounds for the energy of graphs in terms several topological indices graphs: first general multiplicative Zagreb index, Randić zeroth-order redefined indices, atom-bond connectivity index. Moreover, obtain new certain graph invariants as diameter, girth, algebraic radius.

1Department of Pediatrics, University of Zagreb, School of Medicine, University Hospital Centre Zagreb, Zagreb, Croatia, 2Department of Obstetrics and Gynecology, University Hospital Merkur, Zagreb, Croatia, 3Department of Pediatric Surgery, University of Zagreb, School of Medicine, University Hospital Centre Zagreb, Zagreb, Croatia, 4Department of Anesthesiology, Mayo Clinic, 200 First St SW, ...

The first general Zagreb index of a graph $G$ is defined as the sum $\alpha$th powers vertex degrees $G$, where $\alpha$ real number such that $\alpha \neq 0$ and 1$. In this note, for > 1$, we present upper bounds involving chromatic clique numbers graph; an integer \geq 2$, lower bound independence graph.

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.

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