Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 3
Szeged and Mostar root-indices of graphs
Simon Brezovnik, Matthias Dehmer, Niko Tratnik, Petra Žigert Pleteršek
Izvirni znanstveni članek
Oznake: ne zaključna dela;Szeged index;Szeged polynomial;Mostar polynomial;root-index;discrimination power;sensitivity;
Various distance-based root-indices of graphs are introduced and studied in the present article. They are obtained as unique positive roots of modified graph polynomials. In particular, we consider the Szeged polynomial, the weighted-product Szeged polynomial, the weighted-plus Szeged polynomial, an ...
Leto: 2023 Vir: Digitalna knjižnica Univerze v Mariboru (DKUM)
On the Wiener-like root-indices of graphs
Simon Brezovnik, Matthias Dehmer, Niko Tratnik, Petra Žigert Pleteršek
Izvirni znanstveni članek
Oznake: teorija grafov;korenski indeks;diskriminacijska moč;strukturna občutljivost;graph theory;Hosoya polynomial;Schultz polynomial;Gutman polynomial;root-index;discrimination power;structure sensitivity;
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss numerical results. As polynomials, we use, e.g., the Hosoya, the Sch ...
Leto: 2025 Vir: Fakulteta za strojništvo (UL FS)
ǂA ǂdistribution-based framework for network similarity assessment
Matthias Dehmer, Izudin Redžepović, Niko Tratnik, Petra Žigert Pleteršek
Izvirni znanstveni članek
Oznake: analiza omrežij;primerjava omrežij;strukturna podobnost;porazdelitev stopenj;Jensen-Shannonova razdalja;molekularna strukturna podobnost;network similarity measure;degree distribution;distance distribution;Jensen-Shannon divergence;random network models;molecular structural similarity;
Assessing structural similarity between complex systems represented as networks is a fundamental challenge across many disciplines. Existing methods range from exact graph matching to inexact approaches such as graph edit distance, graph kernels, and topological index-based comparisons. In this work ...
Leto: 2026 Vir: Fakulteta za naravoslovje in matematiko (UM FNM)
Št. zadetkov: 3
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: