Results 161 to 170 of about 19,955 (195)

The k-Szeged index of graphs

Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hanyuan Deng, Qiqi Xiao
openaire   +1 more source

The Szeged Treebank

2005
The major aim of the Szeged Treebank project was to create a high-quality database of syntactic structures for Hungarian that can serve as a golden standard to further research in linguistics and computational language processing. The treebank currently contains full syntactic parsing of about 82,000 sentences, which is the result of accurate manual ...
Dóra Csendes, János Csirik, Tibor Gyimóthy, András Kocsor   +3 more
openaire   +1 more source

Szeged in 1934

The American Mathematical Monthly, 1993
1. WHY SZEGED? The year 1933 was dreary and dismal for most people. This was precisely at the end of my studies for the doctorate. By some miracle, I was spared unemployment. I was awarded a National Research Council Fellowship, for a year of postdoctoral study at Harvard University under the guidance of Marshall Stone. There were four N.R.C.
Edgar R. Lorch, Reuben Hersh
openaire   +1 more source

PI, Szeged and Revised Szeged Indices of IPR Fullerenes

2011
In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.
MOTTAGHI, A., MEHRANIAN, Z.
openaire   +1 more source

On the Laplacian Szeged spectrum of paths

Iranian journal of mathemathical chemistry, 2020
We present explicit formulas for the Laplacian Szeged eigenvalues of paths, grids, $C_4$-nanotubes and of Cartesian products of paths with some other simple graphs. A number of open problems is listed.
openaire   +3 more sources

On the Szeged–Sombor Index of Graphs

Mathematical Notes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex, L., Das, K. C.
openaire   +1 more source

On the Szeged and Wiener complexities in graphs

Applied Mathematics and Computation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modjtaba Ghorbani, Zahra Vaziri
openaire   +2 more sources

The Szeged index of fasciagraphs

MATCH : communications in mathematical and in computer chemistry, 2003
Let G**n be a graph which is obtained from a path Pn by replacing each vertex by a fixed graph G and replacing each edge by a fixed set of edges joining the corresponding copies of G. A matrix approach to the computation of distance-based invariants which gives a general procedure to obtain closed-form expressions (depending on n) for such invariants ...
Graovac, Ante, Juvan, Martin, Petkovšek, Marko, Vesel, Aleksander, Žerovnik, Janez   +4 more
openaire   +3 more sources

The Szeged School of Ethnology

Acta Ethnographica Hungarica, 2004
Sandor Balint was an important representative of ethnography in Hungary in the 20th century. In many respects his work is unique: in its themes and from the geographical and methodological viewpoin...
openaire   +2 more sources

Computing Szeged index of graphs on triples

2017
Summary: Let \(G=(V,E)\) be a simple connected graph with vertex set \(V\) and edge set \(E\). The Szeged index of \(G\) is defined by \(S\mathcal z(G)=\sum_{e=uv\in E^nu}(e| G)n_v(e| G)\), where \(n_u(e| G)\) is the number of vertices of \(G\) closer to \(u\) than \(v\) and \(n_v(e| G)\) can be defined in a similar way.
Darafsheh, M., Modabernia, R., Namdari, M.   +2 more
openaire   +1 more source