Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...

We present an information-thoeretical viewpoint for similarity-based retrieval along with index structures. This retrieval system has two stages: pruning data items based on the index structures, and matching surviving data items. The first stage is modeled as the Wyner-Ziv problem, while the second stage is considered as a coding problem where some of the decording results are available as par...

in this paper, at first we mention to some results related to pi and vertex co-pi indices and then we introduce the edge versions of co-pi indices. then, we obtain some properties about these new indices.

a Medical Faculty, Dresden University of Technology, Fetscherstr. 74, Dresden, 01307 Germany b Division of Cardiovascular Pharmacology, Hungarian Academy of Sciences, 6701 Hungary c Department of Pharmacology & Pharmacotherapy, Faculty of Medicine, University of Szeged, Dom ter 12, Szeged, 6701 Hungary d Virginia Commonwealth University, Department of Physiology-Box 980551, Richmond, Virginia 2...

*Imre Máthé and Erzsébet Háznagy-Radnai, Institute of Pharmacognosy, University of Szeged, Eötvös Str. 3, H-6270 Szeged, Hungary; Imre Máthé, Gábor Janicsák and Rita Engel, Centre for Ecological Research, Institute of Ecology and Botany, Hungarian Academy of Sciences, Alkotmány Str. 2, H-2163 Vácrátót, Hungary; Gerald Blunden, School of Pharmacy and Biomedical Sciences, University of Portsmouth...

In this paper, the weighted Szeged indices of Cartesian product and Corona product of two connected graphs are obtained. Using the results obtained here, the weighted Szeged indices of the hypercube of dimension n, Hamming graph, C4 nanotubes, nanotorus, grid, t−fold bristled, sunlet, fan, wheel, bottleneck graphs and some classes of bridge graphs are computed.

1Department of Behavioral Sciences, Faculty of General Medicine, University of Szeged, Szeged, Hungary 2Royal Ottawa Mental Health Centre, Institute of Mental Health Research and Department of Psychiatry, University of Ottawa, Ottawa, Canada 3Department of Psychology, University of Stirling, Stirling, Scotland, UK 4Research and Evaluation Unit, Women’s and Children’s Hospital and School of Paed...

Éva Remenyik, Béla Nagy, Mária Kiss, Imre Veres, Mónika Sápy, Irén Horkay, Irén Erdei and János Hunyadi Departments of Dermatology and, Pediatrics, University of Debrecen, Medical and Health Science Center, University of Debrecen, Nagyerdei körút 98, HU-4012 Debrecen, Hungary and Department of Dermatology and Allergology, University of Szeged, Szeged, Hungary. E-mail: [email protected] Ac...