نتایج جستجو برای: weighted szeged index

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

2014
CRISTINA TRANDAFIRESCU STEFANA AVRAM CODRUTA SOICA ZOLTÁN AIGNER GYÉRESI ÁRPÁD MIHALY KATA CRISTINA DEHELEAN ZOLTÁN SZABADAI FLORIN BORCAN

CRISTINA TRANDAFIRESCU1, STEFANA AVRAM1*, CODRUTA SOICA1, ZOLTÁN AIGNER2, GYÉRESI ÁRPÁD3, MIHALY KATA2, CRISTINA DEHELEAN1, ZOLTÁN SZABADAI1, FLORIN BORCAN1 1Faculty of Pharmacy, Victor Babe’ University of Medicine and Pharmacy, 2nd Eftimie Murgu Sq., 300041, Timisoara, Romania 2Faculty of Pharmacy, University of Szeged, 6th Eötvös Str., Szeged, Hungary 3Faculty of Pharmacy, University of Medic...

2016
Zsolt Molnár Evangelos J Giamarellos-Bourboulis Anand Kumar Axel Nierhaus

1Department of Anaesthesiology and Intensive Therapy, Faculty of Medicine, University of Szeged, 6 Semmelweis St., Szeged 6725, Hungary 24th Department of Internal Medicine, Attikon University Hospital, 1 Rimini Str., 12462 Athens, Greece 3Sections of Critical Care Medicine and Infectious Diseases, Medical Microbiology and Pharmacology, University of Manitoba, Winnipeg, MB, Canada 4Department o...

2006
János Kokavecz Othmar Marti Péter Heszler Ádám Mechler

János Kokavecz,1,* Othmar Marti,2 Péter Heszler,3,4 and Ádám Mechler5,† 1Department of Optics and Quantum Electronics, University of Szeged, P.O. Box 406, H-6701 Szeged, Hungary 2Department of Experimental Physics, University of Ulm, Albert-Einstein-Allee 11 D-89069 Ulm, Germany 3Research Group on Laser Physics of the Hungarian Academy of Sciences, P.O. Box 406, H-6701 Szeged, Hungary 4The Ångs...

2009
Mahsa Mirzargar

Let G be a graph with vertex and edge sets V(G) and E(G), respectively. As usual, the distance between the vertices u and v of a connected graph G is denoted by d(u,v) and it is defined as the number of edges in a minimal path connecting the vertices u and v. Throughout the paper, a graph means undirected connected graph without loops and multiple edges. In chemical graph theory, a molecular gr...

Journal: :Open Journal of Applied Sciences 2021

Journal: :Journal of Economic & Financial Studies 2013

Journal: :Acta Cybern. 2004
Gyula Zsigri András Kocsor László Tóth Györgyi Sejtes

The purpose of this paper is to give an outline of phonetic level annotation and segmentation of Hungarian speech databases at the levels of definition and speech technology. In addition to giving guidance to the definition of the content of a database, the technique of annotation and the procedure of manual segmentation, we also discuss mathematical models of computeraided semi-automatic and a...

Journal: :International Journal of Molecular Sciences 2008
Ali Iranmanesh Yaser Alizadeh Bahman Taherkhani

In this paper we give a GAP program for computing the Szeged and the PI indices of any graph. Also we compute the Szeged and PI indices of VC(5)C(7) [ p,q] and HC(5)C(7) [ p,q] nanotubes by this program.

2011
David W. Kaczka Kenneth R. Lutchen Zoltán Hantos

David W. Kaczka, Kenneth R. Lutchen, and Zoltán Hantos Department of Anaesthesia, Harvard Medical School, Boston; Department of Anesthesia, Critical Care, and Pain Medicine, Beth Israel Deaconess Medical Center, Boston; Department of Biomedical Engineering, Boston University College of Engineering, Boston, Massachusetts; and Department of Medical Physics and Informatics, University of Szeged, S...

Journal: :J. Global Optimization 2008
Chandra Sekhar Pedamallu Linet Özdamar Tibor Csendes Tamás Vinkó

1 Nanyang Technological University, School of Mechanical and Aerospace Engineering, Singapore, 2 New England Biolabs Inc., 240 County Road, Ipswich, MA [email protected] 3 Izmir Ekonomi Universitesi, Izmir, Turkey [email protected] 4 University of Szeged, Institute of Informatics, Szeged, Hungary [email protected] 5 Advanced Concepts Team, ESA/ESTEC, Noordwijk, The Netherlands Tam...

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

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