| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Szeged-like entropies of graphs
Matthias Dehmer, Frank Emmert-Streib, Niko Tratnik, Petra Žigert Pleteršek, 2022, izvirni znanstveni članek

Ključne besede: Szeged entropy, Mostar entropy, PI entropy, cut method, quotient graphs, sensitivity of a topological descriptor
Objavljeno v DKUM: 20.05.2024; Ogledov: 87; Prenosov: 2
.pdf Celotno besedilo (3,17 MB)
Gradivo ima več datotek! Več...

2.
Szeged and Mostar root-indices of graphs
Simon Brezovnik, Matthias Dehmer, Niko Tratnik, Petra Žigert Pleteršek, 2023, izvirni znanstveni članek

Opis: 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, and the Mostar polynomial. We derive closed formulas of these polynomials for some basic families of graphs. Consequently, we provide closed formulas for some root-indices and examine the convergence of sequences of certain root-indices. Moreover, some general properties of studied root-indices are stated. Finally, numerical results related to discrimination power, correlations, structure sensitivity, and abruptness of root-indices are calculated, interpreted, and compared to already known similar descriptors.
Ključne besede: Szeged index, Szeged polynomial, Mostar polynomial, root-index, discrimination power, sensitivity
Objavljeno v DKUM: 18.08.2023; Ogledov: 393; Prenosov: 44
.pdf Celotno besedilo (535,31 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.08 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici