Претрага




Резултати

On highly palindromic words: The n-ary case   [2021]

Ago Kristina  ; Bašić Bojan  

New variants of perfect non-crossing matchings   [2024]

Mantas, Ioannis; Savić, Marko  ; Schrezenmaier, Hendrik

Cubic and quartic net-regular strongly regular signed graphs   [2025]

Anđelić, Milica; Koledin, Tamara  ; Stanić, Zoran  

Graphs with maximal [Formula presented] irregularity   [2018]

Abdo H.; Dimitrov D.; Gutman I.  

More on Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index   [2009]

Pavlović, Ljiljana ; Lazić, Mirjana  ; Aleksić Lampert, Tatjana 

Remarks on the upper bound for the Randic energy of bipartite graphs   [2017]

Glogić, Edin  ; Zogić, Emir  ; Glišović, Nataša  

First vs. best improvement: An empirical study   [2006]

Hansen, Pierre; Mladenović, Nenad  

Multiplicative circulant networks: Topological properties and communication algorithms   [1997]

I. Stojmenović

Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph   [2023]

Stanić, Zoran  

The difference between several metric dimension graph invariants   [2023]

Milivojevic-Danas, Milica  

Филтери

По типу