نتایج جستجو برای: zagreb coindex

تعداد نتایج: 2450  

2005
Ivan Voras Kristijan Zimmer Mario Žagar

. This work explores various ways of distributing the FERweb CMS system (a webbased Content Management System of the University of Zagreb, Faculty of Electrical engineering and computing) Primary aim of this project is enhancing the performance of the system, within the constraint that the efforts must be based on existing technologies used in the project and with minimal impact on the existing...

Journal: :Psychiatria Danubina 2012
Tomislav Franić Tonći Kero Josip Katić Darko Marčinko Marijo Bilušić

QUETIAPINE IN MANAGEMENT OF MANIC SYMPTOMS IN PATIENT WITH HEART TRANSPLANTATION – A CASE REPORT Tomislav Franić, Tonći Kero, Josip Katić, Darko Marčinko & Marijo Bilušić Department of Psychiatry, University of Split School of Medicine, Split, Croatia University of Split School of Medicine, Split, Croatia Department of Psychiatry, University Hospital Zagreb, Zagreb, Croatia Seton Hall Universit...

Journal: :AKCE International Journal of Graphs and Combinatorics 2020

Journal: :Croatica Chemica Acta 2011

Journal: :transactions on combinatorics 2012
mehdi eliasi

the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...

Journal: :iranian journal of mathematical chemistry 2010
g. h. fath–tabar a. azad n. elahinezhad

topological indices are numerical parameters of a graph which characterize its topology. inthis paper the pi, szeged and zagreb group indices of the tetrameric 1,3–adamantane arecomputed.

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].

Journal: :iranian journal of mathematical chemistry 2016
a. behtoei m. anbarloei

in this paper, we determine the degree distance of the complement of arbitrary mycielskian graphs. it is well known that almost all graphs have diameter two. we determine this graphical invariant for the mycielskian of graphs with diameter two.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید