Let $G$ be a finite group. The intersection graph of is whose vertex set the all proper non-trivial subgroups and two distinct vertices $H$ $K$ are adjacent if only $H\cap K \neq \{e\}$, where $e$ identity group $G$. In this paper, we investigate some properties exploring topological indices such as Wiener, Hyper-Wiener, first second Zagreb, Schultz, Gutman eccentric connectivity $D_{2n}$ for $...

1Sveučilište Josipa Jurja Strossmayera u Osijeku, Medicinski fakultet Osijek, Osijek, Hrvatska 2Klinička bolnica Sveti Duh, Zagreb, Hrvatska 3Hrvatski zavod za hitnu medicinu, Zagreb, Hrvatska 4Medicinski fakultet Sveučilišta u Zagrebu, Zagreb, Hrvatska 5Klinička bolnica Merkur, Zagreb, Hrvatska 1Josip Juraj Strossmayer University of Osijek, Faculty of Medicine, Osijek, Croatia 2University Hosp...

PROTON MAGNETIC RESONANCE SPECTROSCOPY IN HUNTINGTON'S DISEASE ACCOMPANYING NEUROBORRELIOSIS Helena Sarac, David Ozretic, Neven Henigsberg, Pero Hrabac, Ivan Bagaric & Lucija Bagaric-Krakan Department of Neurology, University Hospital Zagreb, Zagreb, Croatia Croatian Institute for Brain Research, Zagreb, Croatia School of Medicine, University of Zagreb, Zagreb, Croatia Department of Radiology, ...

Research on graphs combined with groups is an interesting topic in the field of combinatoric algebra where are used to represent a group. One type graph representation group power graph. A G defined as whose vertex set all elements and two distinct vertices b adjacent if only or for positive integer . In addition mathematics, theory can be applied various fields science, one which chemistry, re...

For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

Albertson [3] has defined the irregularity of a simple undirected graph G = (V,E) as irr(G) = ∑ uv∈E |dG(u)− dG(v)| , where dG(u) denotes the degree of a vertex u ∈ V . Recently, this graph invariant gained interest in the chemical graph theory, where it occured in some bounds on the first and the second Zagreb index, and was named the third Zagreb index [13]. For general graphs with n vertices...

Lea Milutinović1, Marijana Braš2,3, Veljko Đorđević3 1University of Zagreb School of Medicine, Student Society for Neuroscience, Zagreb, Croatia, 2Zagreb University Hospital Centre, Department of Psychological Medicine, Zagreb, Croatia, 3University of Zagreb School of Medicine, Centre for Palliative Medicine, Medical Ethics and Communication Skills, Zagreb, Croatia / 1Sveučilište u Zagrebu, Med...

School of Medicine, University of Zagreb, Croatia (VI, MJ); School of Medicine, University of Zagreb, Department of Nephrology, Hypertension, Dialysis and Transplantation, University Hospital Center Zagreb, Croatia (ML, AV, SK, JK, TZ, VP, MZ, BJ); School of Medicine, University of Zagreb, Department of Metabolic Disorders, University Hospital Center Zagreb, Zagreb, Croatia (IP); and School of ...