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

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

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

We prove a conjecture of Nadjafi-Arani et al. on the difference between the Szeged and the Wiener index of a graph (M. J. Nadjafi-Arani, H. Khodashenas, A. R. Ashrafi: Graphs whose Szeged and Wiener numbers differ by 4 and 5, Math. Comput. Modelling 55 (2012), 1644–1648). Namely, if G is a 2-connected non-complete graph on n vertices, then Sz (G) −W (G) ≥ 2n − 6. Furthermore, the equality is ob...

The Szeged index of a graph G is defined as S z(G) = ∑ uv = e ∈ E(G) nu(e)nv(e), where nu(e) is number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G. Similarly, the revised Szeged index of G is defined as S z∗(G) = ∑ uv = e ∈ E(G) ( nu(e) + nG(e) 2 ) ( nv(e) + nG(e) 2 ) , where nG(e) is the number of equidistant vertices of e in G. In this paper,...

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.

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

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

Head: Prof. Dr. Judit Hohmann, Univ. of Szeged, Dept. Of Pharmacognosy Reviewers: Dr. György Stampf Ph.D., Semmelweis Univ., Dept. Of Pharmaceutics Dr. Miklós Vecsernyés Ph.D., Univ. of Debrecen, Dept. of Pharmaceutical Technology Members: Dr. Attila Dévay Ph.D., Univ. of Pécs, Inst. of Pharmaceutical Technology and Biopharmacy Dr. Róbert Gáspár Ph.D., Univ. of Szeged, Dept. of Pharmacodynamics...

Recently, it was conjectured by Gutman and Ashrafi that the complete graph Kn has the greatest edge-Szeged index among simple graphs with n vertices. This conjecture turned out to be false, but led Vukičević to conjecture the coefficient 1/15552 of n6 for the approximate value of the greatest edge-Szeged index. We provide counterexamples to this conjecture.